./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.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/ArraysOfVariableLength6.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 07b05923cf5c1b39a35ab81b524575a0a488c268 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:43,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:00:43,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:00:43,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:00:43,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:00:43,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:00:43,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:00:43,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:00:43,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:00:43,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:00:43,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:00:43,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:00:43,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:00:43,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:00:43,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:00:43,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:00:43,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:00:43,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:00:43,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:00:43,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:00:43,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:00:43,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:00:43,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:00:43,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:00:43,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:00:43,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:00:43,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:00:43,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:00:43,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:00:43,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:00:43,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:00:43,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:00:43,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:00:43,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:00:43,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:00:43,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:00:43,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:00:43,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:00:43,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:00:43,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:00:43,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:00:43,222 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:43,237 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:00:43,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:00:43,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:00:43,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:00:43,239 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:00:43,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:00:43,240 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:00:43,240 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:00:43,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:00:43,241 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:00:43,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:00:43,241 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:00:43,241 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:00:43,242 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:00:43,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:00:43,242 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:00:43,243 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:00:43,243 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:00:43,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:00:43,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:00:43,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:00:43,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:00:43,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:00:43,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:00:43,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:00:43,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:00:43,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:00:43,246 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:00:43,246 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 -> 07b05923cf5c1b39a35ab81b524575a0a488c268 [2020-07-29 01:00:43,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:00:43,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:00:43,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:00:43,567 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:00:43,567 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:00:43,568 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2020-07-29 01:00:43,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1767425e/82935e092e804a459b3e18b17e14cae8/FLAG24d2fc794 [2020-07-29 01:00:44,073 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:00:44,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2020-07-29 01:00:44,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1767425e/82935e092e804a459b3e18b17e14cae8/FLAG24d2fc794 [2020-07-29 01:00:44,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1767425e/82935e092e804a459b3e18b17e14cae8 [2020-07-29 01:00:44,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:00:44,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:00:44,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:44,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:00:44,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:00:44,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:44" (1/1) ... [2020-07-29 01:00:44,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d874a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:44, skipping insertion in model container [2020-07-29 01:00:44,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:00:44" (1/1) ... [2020-07-29 01:00:44,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:00:44,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:00:44,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:44,726 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:00:44,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:00:44,765 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:00:44,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:44 WrapperNode [2020-07-29 01:00:44,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:00:44,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:00:44,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:00:44,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:00:44,837 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:44" (1/1) ... [2020-07-29 01:00:44,838 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:44" (1/1) ... [2020-07-29 01:00:44,845 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:44" (1/1) ... [2020-07-29 01:00:44,845 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:44" (1/1) ... [2020-07-29 01:00:44,855 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:44" (1/1) ... [2020-07-29 01:00:44,861 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:44" (1/1) ... [2020-07-29 01:00:44,862 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:44" (1/1) ... [2020-07-29 01:00:44,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:00:44,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:00:44,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:00:44,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:00:44,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:44" (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:44,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:00:44,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:00:44,923 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2020-07-29 01:00:44,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:00:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2020-07-29 01:00:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:00:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:00:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:00:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:00:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:00:44,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:00:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:00:45,367 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:00:45,367 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-29 01:00:45,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:45 BoogieIcfgContainer [2020-07-29 01:00:45,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:00:45,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:00:45,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:00:45,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:00:45,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:00:44" (1/3) ... [2020-07-29 01:00:45,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f75c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:45, skipping insertion in model container [2020-07-29 01:00:45,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:00:44" (2/3) ... [2020-07-29 01:00:45,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f75c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:00:45, skipping insertion in model container [2020-07-29 01:00:45,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:00:45" (3/3) ... [2020-07-29 01:00:45,379 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6.c [2020-07-29 01:00:45,389 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:00:45,396 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-29 01:00:45,410 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-29 01:00:45,430 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:00:45,430 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:00:45,430 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:00:45,430 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:00:45,430 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:00:45,430 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:00:45,431 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:00:45,431 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:00:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-29 01:00:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-29 01:00:45,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:45,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:45,457 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:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2020-07-29 01:00:45,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:45,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29453946] [2020-07-29 01:00:45,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:45,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:45,693 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:45,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-29 01:00:45,694 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-29 01:00:45,699 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:45,699 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:45,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-29 01:00:45,700 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #74#return; {43#true} is VALID [2020-07-29 01:00:45,701 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2020-07-29 01:00:45,702 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);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:45,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {48#(= 0 main_~i~1)} assume !(~i~1 < 32); {44#false} is VALID [2020-07-29 01:00:45,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#false} ~i~1 := 0; {44#false} is VALID [2020-07-29 01:00:45,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#false} assume !!(~i~1 < 32); {44#false} is VALID [2020-07-29 01:00:45,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#false} assume !(1 == #valid[~#b~0.base]); {44#false} is VALID [2020-07-29 01:00:45,706 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:45,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29453946] [2020-07-29 01:00:45,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:45,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:00:45,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751311498] [2020-07-29 01:00:45,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:45,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:45,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:45,744 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:45,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:45,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:45,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:45,759 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2020-07-29 01:00:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:46,107 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2020-07-29 01:00:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:00:46,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-29 01:00:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-29 01:00:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2020-07-29 01:00:46,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2020-07-29 01:00:46,226 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:46,241 INFO L225 Difference]: With dead ends: 58 [2020-07-29 01:00:46,242 INFO L226 Difference]: Without dead ends: 54 [2020-07-29 01:00:46,244 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:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-29 01:00:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2020-07-29 01:00:46,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:46,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 39 states. [2020-07-29 01:00:46,280 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 39 states. [2020-07-29 01:00:46,280 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 39 states. [2020-07-29 01:00:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:46,289 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-29 01:00:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:00:46,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:46,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:46,291 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 54 states. [2020-07-29 01:00:46,291 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 54 states. [2020-07-29 01:00:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:46,298 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-29 01:00:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:00:46,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:46,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:46,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:46,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:00:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-29 01:00:46,305 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2020-07-29 01:00:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:46,305 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-29 01:00:46,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-29 01:00:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-29 01:00:46,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:46,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:46,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-29 01:00:46,308 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:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2020-07-29 01:00:46,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:46,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538949638] [2020-07-29 01:00:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:46,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:46,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {265#(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:46,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {259#true} assume true; {259#true} is VALID [2020-07-29 01:00:46,398 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {259#true} {259#true} #74#return; {259#true} is VALID [2020-07-29 01:00:46,400 INFO L263 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {265#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:46,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#(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:46,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {259#true} assume true; {259#true} is VALID [2020-07-29 01:00:46,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {259#true} {259#true} #74#return; {259#true} is VALID [2020-07-29 01:00:46,401 INFO L263 TraceCheckUtils]: 4: Hoare triple {259#true} call #t~ret6 := main(); {259#true} is VALID [2020-07-29 01:00:46,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {259#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {259#true} is VALID [2020-07-29 01:00:46,402 INFO L280 TraceCheckUtils]: 6: Hoare triple {259#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {259#true} is VALID [2020-07-29 01:00:46,402 INFO L263 TraceCheckUtils]: 7: Hoare triple {259#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {259#true} is VALID [2020-07-29 01:00:46,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {259#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {264#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:46,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {264#(= 0 foo_~i~0)} assume !!(~i~0 < ~size); {264#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:46,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {264#(= 0 foo_~i~0)} assume !(0 <= ~i~0 && ~i~0 < 32); {260#false} is VALID [2020-07-29 01:00:46,409 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:46,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538949638] [2020-07-29 01:00:46,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:46,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:00:46,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519435316] [2020-07-29 01:00:46,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:00:46,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:46,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:46,431 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:46,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:46,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:00:46,434 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2020-07-29 01:00:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:46,646 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-29 01:00:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:46,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-29 01:00:46,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-29 01:00:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-29 01:00:46,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2020-07-29 01:00:46,748 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:46,751 INFO L225 Difference]: With dead ends: 49 [2020-07-29 01:00:46,751 INFO L226 Difference]: Without dead ends: 49 [2020-07-29 01:00:46,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-29 01:00:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-07-29 01:00:46,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:46,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 41 states. [2020-07-29 01:00:46,758 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 41 states. [2020-07-29 01:00:46,758 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 41 states. [2020-07-29 01:00:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:46,762 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-29 01:00:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-29 01:00:46,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:46,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:46,764 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 49 states. [2020-07-29 01:00:46,764 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 49 states. [2020-07-29 01:00:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:46,769 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-29 01:00:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-29 01:00:46,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:46,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:46,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:46,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 01:00:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-29 01:00:46,774 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2020-07-29 01:00:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:46,774 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-29 01:00:46,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-29 01:00:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:00:46,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:46,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:46,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-29 01:00:46,777 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:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2020-07-29 01:00:46,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:46,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274972693] [2020-07-29 01:00:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:46,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:46,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#(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; {458#true} is VALID [2020-07-29 01:00:46,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2020-07-29 01:00:46,909 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #74#return; {458#true} is VALID [2020-07-29 01:00:46,910 INFO L263 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {467#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:46,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {467#(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; {458#true} is VALID [2020-07-29 01:00:46,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2020-07-29 01:00:46,912 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #74#return; {458#true} is VALID [2020-07-29 01:00:46,913 INFO L263 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret6 := main(); {458#true} is VALID [2020-07-29 01:00:46,915 INFO L280 TraceCheckUtils]: 5: Hoare triple {458#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {463#(= 1 (select |#valid| |main_~#mask~0.base|))} is VALID [2020-07-29 01:00:46,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {463#(= 1 (select |#valid| |main_~#mask~0.base|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {464#(= 1 (select |#valid| main_~c~0.base))} is VALID [2020-07-29 01:00:46,920 INFO L263 TraceCheckUtils]: 7: Hoare triple {464#(= 1 (select |#valid| main_~c~0.base))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {465#(= 1 (select |#valid| |foo_#in~b.base|))} is VALID [2020-07-29 01:00:46,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {465#(= 1 (select |#valid| |foo_#in~b.base|))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {466#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:46,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {466#(= 1 (select |#valid| foo_~b.base))} assume !!(~i~0 < ~size); {466#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:46,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {466#(= 1 (select |#valid| foo_~b.base))} assume 0 <= ~i~0 && ~i~0 < 32; {466#(= 1 (select |#valid| foo_~b.base))} is VALID [2020-07-29 01:00:46,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {466#(= 1 (select |#valid| foo_~b.base))} assume !(1 == #valid[~b.base]); {459#false} is VALID [2020-07-29 01:00:46,925 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:46,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274972693] [2020-07-29 01:00:46,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:46,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:00:46,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111753073] [2020-07-29 01:00:46,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-29 01:00:46,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:46,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:00:46,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:46,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:00:46,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:00:46,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:00:46,948 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-07-29 01:00:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:47,392 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-29 01:00:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:00:47,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-29 01:00:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2020-07-29 01:00:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2020-07-29 01:00:47,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2020-07-29 01:00:47,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:47,458 INFO L225 Difference]: With dead ends: 40 [2020-07-29 01:00:47,458 INFO L226 Difference]: Without dead ends: 40 [2020-07-29 01:00:47,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:00:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-29 01:00:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-29 01:00:47,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:47,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:47,462 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:47,463 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:47,465 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-29 01:00:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-29 01:00:47,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:47,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:47,466 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:47,468 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:47,473 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-29 01:00:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-29 01:00:47,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:47,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:47,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:47,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:00:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-29 01:00:47,485 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2020-07-29 01:00:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:47,486 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-29 01:00:47,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:00:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-29 01:00:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-29 01:00:47,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:47,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:47,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-29 01:00:47,487 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:47,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:47,488 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2020-07-29 01:00:47,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:47,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888469938] [2020-07-29 01:00:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:47,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {645#(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; {636#true} is VALID [2020-07-29 01:00:47,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#true} assume true; {636#true} is VALID [2020-07-29 01:00:47,654 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {636#true} {636#true} #74#return; {636#true} is VALID [2020-07-29 01:00:47,656 INFO L263 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {645#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:47,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#(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; {636#true} is VALID [2020-07-29 01:00:47,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2020-07-29 01:00:47,656 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #74#return; {636#true} is VALID [2020-07-29 01:00:47,657 INFO L263 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret6 := main(); {636#true} is VALID [2020-07-29 01:00:47,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {636#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {641#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:47,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {641#(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; {642#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:47,661 INFO L263 TraceCheckUtils]: 7: Hoare triple {642#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {643#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:47,662 INFO L280 TraceCheckUtils]: 8: Hoare triple {643#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {644#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:47,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {644#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {644#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:47,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {644#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {644#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:47,668 INFO L280 TraceCheckUtils]: 11: Hoare triple {644#(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); {637#false} is VALID [2020-07-29 01:00:47,669 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:47,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888469938] [2020-07-29 01:00:47,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:47,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:00:47,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503230126] [2020-07-29 01:00:47,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-29 01:00:47,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:47,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:00:47,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:47,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:00:47,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:47,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:00:47,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:00:47,691 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2020-07-29 01:00:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:48,239 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-29 01:00:48,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:00:48,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-29 01:00:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-29 01:00:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:48,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2020-07-29 01:00:48,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2020-07-29 01:00:48,330 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:48,332 INFO L225 Difference]: With dead ends: 46 [2020-07-29 01:00:48,332 INFO L226 Difference]: Without dead ends: 46 [2020-07-29 01:00:48,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:00:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-29 01:00:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2020-07-29 01:00:48,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:48,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 41 states. [2020-07-29 01:00:48,336 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 41 states. [2020-07-29 01:00:48,337 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 41 states. [2020-07-29 01:00:48,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:48,339 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-29 01:00:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-29 01:00:48,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:48,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:48,340 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 46 states. [2020-07-29 01:00:48,340 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 46 states. [2020-07-29 01:00:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:48,343 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-29 01:00:48,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-29 01:00:48,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:48,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:48,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:48,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 01:00:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-29 01:00:48,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2020-07-29 01:00:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:48,346 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-29 01:00:48,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:00:48,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-29 01:00:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:00:48,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:48,347 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:48,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-29 01:00:48,348 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:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2020-07-29 01:00:48,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:48,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292889620] [2020-07-29 01:00:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:48,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:48,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {843#(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; {833#true} is VALID [2020-07-29 01:00:48,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {833#true} assume true; {833#true} is VALID [2020-07-29 01:00:48,388 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {833#true} {833#true} #74#return; {833#true} is VALID [2020-07-29 01:00:48,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:48,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {833#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {844#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:48,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {844#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !(~i~0 < ~size); {845#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:48,464 INFO L280 TraceCheckUtils]: 2: Hoare triple {845#(not (= 32 |foo_#in~size|))} #res := ~i~0; {845#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:48,465 INFO L280 TraceCheckUtils]: 3: Hoare triple {845#(not (= 32 |foo_#in~size|))} assume true; {845#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:48,467 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {845#(not (= 32 |foo_#in~size|))} {833#true} #78#return; {834#false} is VALID [2020-07-29 01:00:48,473 INFO L263 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {843#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:48,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {843#(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; {833#true} is VALID [2020-07-29 01:00:48,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2020-07-29 01:00:48,474 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #74#return; {833#true} is VALID [2020-07-29 01:00:48,475 INFO L263 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret6 := main(); {833#true} is VALID [2020-07-29 01:00:48,475 INFO L280 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {833#true} is VALID [2020-07-29 01:00:48,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {833#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {833#true} is VALID [2020-07-29 01:00:48,476 INFO L263 TraceCheckUtils]: 7: Hoare triple {833#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {833#true} is VALID [2020-07-29 01:00:48,478 INFO L280 TraceCheckUtils]: 8: Hoare triple {833#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {844#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:48,479 INFO L280 TraceCheckUtils]: 9: Hoare triple {844#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !(~i~0 < ~size); {845#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:48,479 INFO L280 TraceCheckUtils]: 10: Hoare triple {845#(not (= 32 |foo_#in~size|))} #res := ~i~0; {845#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:48,480 INFO L280 TraceCheckUtils]: 11: Hoare triple {845#(not (= 32 |foo_#in~size|))} assume true; {845#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:48,483 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {845#(not (= 32 |foo_#in~size|))} {833#true} #78#return; {834#false} is VALID [2020-07-29 01:00:48,483 INFO L280 TraceCheckUtils]: 13: Hoare triple {834#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {834#false} is VALID [2020-07-29 01:00:48,483 INFO L280 TraceCheckUtils]: 14: Hoare triple {834#false} assume !(1 == #valid[~#b~0.base]); {834#false} is VALID [2020-07-29 01:00:48,484 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:48,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292889620] [2020-07-29 01:00:48,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:00:48,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:00:48,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905971631] [2020-07-29 01:00:48,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-29 01:00:48,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:48,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:00:48,501 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:48,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:00:48,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:48,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:00:48,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:00:48,502 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2020-07-29 01:00:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:48,773 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2020-07-29 01:00:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:00:48,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-29 01:00:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:00:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-29 01:00:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:00:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-29 01:00:48,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2020-07-29 01:00:48,849 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:48,850 INFO L225 Difference]: With dead ends: 46 [2020-07-29 01:00:48,850 INFO L226 Difference]: Without dead ends: 43 [2020-07-29 01:00:48,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:00:48,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-29 01:00:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-07-29 01:00:48,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:48,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2020-07-29 01:00:48,856 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2020-07-29 01:00:48,857 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2020-07-29 01:00:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:48,861 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:00:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:00:48,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:48,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:48,867 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2020-07-29 01:00:48,868 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2020-07-29 01:00:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:48,874 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-29 01:00:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-29 01:00:48,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:48,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:48,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:48,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 01:00:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-07-29 01:00:48,877 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 15 [2020-07-29 01:00:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:48,878 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-07-29 01:00:48,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:00:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-07-29 01:00:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:00:48,879 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:48,879 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:48,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-29 01:00:48,880 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:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:48,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2020-07-29 01:00:48,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:48,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813486895] [2020-07-29 01:00:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:48,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:48,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {1032#(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; {1025#true} is VALID [2020-07-29 01:00:48,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {1025#true} assume true; {1025#true} is VALID [2020-07-29 01:00:48,988 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1025#true} {1025#true} #74#return; {1025#true} is VALID [2020-07-29 01:00:48,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1032#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:48,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {1032#(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; {1025#true} is VALID [2020-07-29 01:00:48,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2020-07-29 01:00:48,990 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #74#return; {1025#true} is VALID [2020-07-29 01:00:48,990 INFO L263 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret6 := main(); {1025#true} is VALID [2020-07-29 01:00:48,990 INFO L280 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1025#true} is VALID [2020-07-29 01:00:48,990 INFO L280 TraceCheckUtils]: 6: Hoare triple {1025#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1025#true} is VALID [2020-07-29 01:00:48,991 INFO L263 TraceCheckUtils]: 7: Hoare triple {1025#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1025#true} is VALID [2020-07-29 01:00:48,995 INFO L280 TraceCheckUtils]: 8: Hoare triple {1025#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:48,996 INFO L280 TraceCheckUtils]: 9: Hoare triple {1030#(= 0 foo_~i~0)} assume !!(~i~0 < ~size); {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:48,997 INFO L280 TraceCheckUtils]: 10: Hoare triple {1030#(= 0 foo_~i~0)} assume 0 <= ~i~0 && ~i~0 < 32; {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:48,997 INFO L280 TraceCheckUtils]: 11: Hoare triple {1030#(= 0 foo_~i~0)} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:48,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= 0 foo_~i~0)} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:48,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {1030#(= 0 foo_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:49,000 INFO L280 TraceCheckUtils]: 14: Hoare triple {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:49,001 INFO L280 TraceCheckUtils]: 15: Hoare triple {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !(0 <= ~i~0 && ~i~0 < 32); {1026#false} is VALID [2020-07-29 01:00:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:49,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813486895] [2020-07-29 01:00:49,002 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419503767] [2020-07-29 01:00:49,002 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:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:00:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:49,108 INFO L263 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2020-07-29 01:00:49,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {1025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1025#true} is VALID [2020-07-29 01:00:49,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2020-07-29 01:00:49,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #74#return; {1025#true} is VALID [2020-07-29 01:00:49,109 INFO L263 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret6 := main(); {1025#true} is VALID [2020-07-29 01:00:49,109 INFO L280 TraceCheckUtils]: 5: Hoare triple {1025#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1025#true} is VALID [2020-07-29 01:00:49,110 INFO L280 TraceCheckUtils]: 6: Hoare triple {1025#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1025#true} is VALID [2020-07-29 01:00:49,110 INFO L263 TraceCheckUtils]: 7: Hoare triple {1025#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1025#true} is VALID [2020-07-29 01:00:49,116 INFO L280 TraceCheckUtils]: 8: Hoare triple {1025#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:49,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {1030#(= 0 foo_~i~0)} assume !!(~i~0 < ~size); {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:49,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {1030#(= 0 foo_~i~0)} assume 0 <= ~i~0 && ~i~0 < 32; {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:49,118 INFO L280 TraceCheckUtils]: 11: Hoare triple {1030#(= 0 foo_~i~0)} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:49,119 INFO L280 TraceCheckUtils]: 12: Hoare triple {1030#(= 0 foo_~i~0)} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1030#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:49,119 INFO L280 TraceCheckUtils]: 13: Hoare triple {1030#(= 0 foo_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:49,120 INFO L280 TraceCheckUtils]: 14: Hoare triple {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:49,121 INFO L280 TraceCheckUtils]: 15: Hoare triple {1031#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !(0 <= ~i~0 && ~i~0 < 32); {1026#false} is VALID [2020-07-29 01:00:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:49,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:49,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2020-07-29 01:00:49,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835815707] [2020-07-29 01:00:49,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:00:49,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:49,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:00:49,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:49,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:00:49,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:00:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:00:49,143 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2020-07-29 01:00:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:49,414 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-29 01:00:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:00:49,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:00:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:00:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-29 01:00:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:00:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-29 01:00:49,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-29 01:00:49,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:49,493 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:00:49,493 INFO L226 Difference]: Without dead ends: 52 [2020-07-29 01:00:49,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:00:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-29 01:00:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2020-07-29 01:00:49,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:49,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 45 states. [2020-07-29 01:00:49,497 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 45 states. [2020-07-29 01:00:49,497 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 45 states. [2020-07-29 01:00:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:49,500 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-29 01:00:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-29 01:00:49,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:49,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:49,501 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 52 states. [2020-07-29 01:00:49,501 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 52 states. [2020-07-29 01:00:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:49,504 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-29 01:00:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-29 01:00:49,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:49,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:49,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:49,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:00:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-29 01:00:49,507 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 16 [2020-07-29 01:00:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:49,507 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-29 01:00:49,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:00:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-29 01:00:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-29 01:00:49,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:49,508 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:49,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-29 01:00:49,722 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:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1213405753, now seen corresponding path program 1 times [2020-07-29 01:00:49,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:49,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383158391] [2020-07-29 01:00:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,913 INFO L280 TraceCheckUtils]: 0: Hoare triple {1296#(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; {1285#true} is VALID [2020-07-29 01:00:49,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {1285#true} assume true; {1285#true} is VALID [2020-07-29 01:00:49,913 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1285#true} {1285#true} #74#return; {1285#true} is VALID [2020-07-29 01:00:49,914 INFO L263 TraceCheckUtils]: 0: Hoare triple {1285#true} call ULTIMATE.init(); {1296#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:49,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {1296#(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; {1285#true} is VALID [2020-07-29 01:00:49,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {1285#true} assume true; {1285#true} is VALID [2020-07-29 01:00:49,915 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1285#true} {1285#true} #74#return; {1285#true} is VALID [2020-07-29 01:00:49,915 INFO L263 TraceCheckUtils]: 4: Hoare triple {1285#true} call #t~ret6 := main(); {1285#true} is VALID [2020-07-29 01:00:49,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {1285#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1290#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:49,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {1290#(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; {1291#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:49,919 INFO L263 TraceCheckUtils]: 7: Hoare triple {1291#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1292#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:49,920 INFO L280 TraceCheckUtils]: 8: Hoare triple {1292#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:49,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:49,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:49,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {1293#(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 {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:49,924 INFO L280 TraceCheckUtils]: 12: Hoare triple {1293#(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; {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:49,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {1293#(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; {1294#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:49,925 INFO L280 TraceCheckUtils]: 14: Hoare triple {1294#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {1294#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:49,926 INFO L280 TraceCheckUtils]: 15: Hoare triple {1294#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {1295#(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:49,927 INFO L280 TraceCheckUtils]: 16: Hoare triple {1295#(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); {1286#false} is VALID [2020-07-29 01:00:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:49,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383158391] [2020-07-29 01:00:49,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395314257] [2020-07-29 01:00:49,930 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:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-29 01:00:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:49,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:50,049 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:50,050 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:50,050 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:50,069 INFO L624 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-29 01:00:50,074 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:50,074 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-29 01:00:50,078 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:50,078 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_12|, |main_~#b~0.base|]. (and (= 0 |main_~#mask~0.offset|) (= (store (store |v_#length_12| |main_~#b~0.base| 400) |main_~#mask~0.base| 32) |#length|)) [2020-07-29 01:00:50,078 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:50,124 INFO L263 TraceCheckUtils]: 0: Hoare triple {1285#true} call ULTIMATE.init(); {1285#true} is VALID [2020-07-29 01:00:50,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {1285#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1285#true} is VALID [2020-07-29 01:00:50,124 INFO L280 TraceCheckUtils]: 2: Hoare triple {1285#true} assume true; {1285#true} is VALID [2020-07-29 01:00:50,125 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1285#true} {1285#true} #74#return; {1285#true} is VALID [2020-07-29 01:00:50,125 INFO L263 TraceCheckUtils]: 4: Hoare triple {1285#true} call #t~ret6 := main(); {1285#true} is VALID [2020-07-29 01:00:50,126 INFO L280 TraceCheckUtils]: 5: Hoare triple {1285#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1290#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:50,127 INFO L280 TraceCheckUtils]: 6: Hoare triple {1290#(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; {1291#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:50,129 INFO L263 TraceCheckUtils]: 7: Hoare triple {1291#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1292#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:50,129 INFO L280 TraceCheckUtils]: 8: Hoare triple {1292#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,130 INFO L280 TraceCheckUtils]: 9: Hoare triple {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,132 INFO L280 TraceCheckUtils]: 11: Hoare triple {1293#(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 {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,132 INFO L280 TraceCheckUtils]: 12: Hoare triple {1293#(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; {1293#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:50,133 INFO L280 TraceCheckUtils]: 13: Hoare triple {1293#(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; {1339#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} is VALID [2020-07-29 01:00:50,134 INFO L280 TraceCheckUtils]: 14: Hoare triple {1339#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} assume !!(~i~0 < ~size); {1339#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} is VALID [2020-07-29 01:00:50,135 INFO L280 TraceCheckUtils]: 15: Hoare triple {1339#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} assume 0 <= ~i~0 && ~i~0 < 32; {1339#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (= 1 foo_~i~0))} is VALID [2020-07-29 01:00:50,136 INFO L280 TraceCheckUtils]: 16: Hoare triple {1339#(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); {1286#false} is VALID [2020-07-29 01:00:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:50,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:50,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2020-07-29 01:00:50,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44834948] [2020-07-29 01:00:50,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-29 01:00:50,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:50,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:00:50,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:50,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:00:50,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:50,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:00:50,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:00:50,167 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 10 states. [2020-07-29 01:00:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:50,942 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-29 01:00:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:00:50,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-07-29 01:00:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:00:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-29 01:00:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:00:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2020-07-29 01:00:50,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2020-07-29 01:00:51,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:51,040 INFO L225 Difference]: With dead ends: 51 [2020-07-29 01:00:51,040 INFO L226 Difference]: Without dead ends: 51 [2020-07-29 01:00:51,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-29 01:00:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-29 01:00:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2020-07-29 01:00:51,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:51,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 46 states. [2020-07-29 01:00:51,046 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 46 states. [2020-07-29 01:00:51,046 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 46 states. [2020-07-29 01:00:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:51,049 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-29 01:00:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-07-29 01:00:51,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:51,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:51,050 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 51 states. [2020-07-29 01:00:51,050 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 51 states. [2020-07-29 01:00:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:51,055 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-29 01:00:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-07-29 01:00:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:51,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:51,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:51,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:00:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-29 01:00:51,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2020-07-29 01:00:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:51,058 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-29 01:00:51,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:00:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-29 01:00:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:00:51,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:51,059 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] [2020-07-29 01:00:51,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:51,261 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:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:51,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2020-07-29 01:00:51,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:51,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682809084] [2020-07-29 01:00:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:51,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:51,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {1570#(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; {1555#true} is VALID [2020-07-29 01:00:51,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {1555#true} assume true; {1555#true} is VALID [2020-07-29 01:00:51,312 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1555#true} {1555#true} #74#return; {1555#true} is VALID [2020-07-29 01:00:51,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:51,426 INFO L280 TraceCheckUtils]: 0: Hoare triple {1555#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,427 INFO L280 TraceCheckUtils]: 1: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,429 INFO L280 TraceCheckUtils]: 3: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,430 INFO L280 TraceCheckUtils]: 4: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,430 INFO L280 TraceCheckUtils]: 5: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1572#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:51,431 INFO L280 TraceCheckUtils]: 6: Hoare triple {1572#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !(~i~0 < ~size); {1573#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:51,431 INFO L280 TraceCheckUtils]: 7: Hoare triple {1573#(not (= 32 |foo_#in~size|))} #res := ~i~0; {1573#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:51,432 INFO L280 TraceCheckUtils]: 8: Hoare triple {1573#(not (= 32 |foo_#in~size|))} assume true; {1573#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:51,433 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1573#(not (= 32 |foo_#in~size|))} {1555#true} #78#return; {1556#false} is VALID [2020-07-29 01:00:51,437 INFO L263 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1570#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:51,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {1570#(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; {1555#true} is VALID [2020-07-29 01:00:51,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {1555#true} assume true; {1555#true} is VALID [2020-07-29 01:00:51,437 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} #74#return; {1555#true} is VALID [2020-07-29 01:00:51,437 INFO L263 TraceCheckUtils]: 4: Hoare triple {1555#true} call #t~ret6 := main(); {1555#true} is VALID [2020-07-29 01:00:51,438 INFO L280 TraceCheckUtils]: 5: Hoare triple {1555#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1555#true} is VALID [2020-07-29 01:00:51,438 INFO L280 TraceCheckUtils]: 6: Hoare triple {1555#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1555#true} is VALID [2020-07-29 01:00:51,438 INFO L263 TraceCheckUtils]: 7: Hoare triple {1555#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1555#true} is VALID [2020-07-29 01:00:51,444 INFO L280 TraceCheckUtils]: 8: Hoare triple {1555#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,447 INFO L280 TraceCheckUtils]: 10: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,448 INFO L280 TraceCheckUtils]: 11: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,448 INFO L280 TraceCheckUtils]: 12: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:51,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {1571#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1572#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:51,453 INFO L280 TraceCheckUtils]: 14: Hoare triple {1572#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !(~i~0 < ~size); {1573#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:51,455 INFO L280 TraceCheckUtils]: 15: Hoare triple {1573#(not (= 32 |foo_#in~size|))} #res := ~i~0; {1573#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:51,456 INFO L280 TraceCheckUtils]: 16: Hoare triple {1573#(not (= 32 |foo_#in~size|))} assume true; {1573#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:51,457 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1573#(not (= 32 |foo_#in~size|))} {1555#true} #78#return; {1556#false} is VALID [2020-07-29 01:00:51,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {1556#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1556#false} is VALID [2020-07-29 01:00:51,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {1556#false} assume !(1 == #valid[~#b~0.base]); {1556#false} is VALID [2020-07-29 01:00:51,458 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:51,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682809084] [2020-07-29 01:00:51,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225528946] [2020-07-29 01:00:51,459 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:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:51,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:00:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:51,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:51,675 INFO L263 TraceCheckUtils]: 0: Hoare triple {1555#true} call ULTIMATE.init(); {1555#true} is VALID [2020-07-29 01:00:51,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {1555#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1555#true} is VALID [2020-07-29 01:00:51,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {1555#true} assume true; {1555#true} is VALID [2020-07-29 01:00:51,676 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1555#true} {1555#true} #74#return; {1555#true} is VALID [2020-07-29 01:00:51,676 INFO L263 TraceCheckUtils]: 4: Hoare triple {1555#true} call #t~ret6 := main(); {1555#true} is VALID [2020-07-29 01:00:51,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {1555#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1555#true} is VALID [2020-07-29 01:00:51,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {1555#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1555#true} is VALID [2020-07-29 01:00:51,677 INFO L263 TraceCheckUtils]: 7: Hoare triple {1555#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1555#true} is VALID [2020-07-29 01:00:51,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {1555#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:51,682 INFO L280 TraceCheckUtils]: 9: Hoare triple {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:51,683 INFO L280 TraceCheckUtils]: 10: Hoare triple {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:51,684 INFO L280 TraceCheckUtils]: 11: Hoare triple {1601#(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 {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:51,685 INFO L280 TraceCheckUtils]: 12: Hoare triple {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:51,686 INFO L280 TraceCheckUtils]: 13: Hoare triple {1601#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1617#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:51,687 INFO L280 TraceCheckUtils]: 14: Hoare triple {1617#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !(~i~0 < ~size); {1621#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:51,687 INFO L280 TraceCheckUtils]: 15: Hoare triple {1621#(<= |foo_#in~size| 1)} #res := ~i~0; {1621#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:51,694 INFO L280 TraceCheckUtils]: 16: Hoare triple {1621#(<= |foo_#in~size| 1)} assume true; {1621#(<= |foo_#in~size| 1)} is VALID [2020-07-29 01:00:51,695 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1621#(<= |foo_#in~size| 1)} {1555#true} #78#return; {1556#false} is VALID [2020-07-29 01:00:51,695 INFO L280 TraceCheckUtils]: 18: Hoare triple {1556#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {1556#false} is VALID [2020-07-29 01:00:51,696 INFO L280 TraceCheckUtils]: 19: Hoare triple {1556#false} assume !(1 == #valid[~#b~0.base]); {1556#false} is VALID [2020-07-29 01:00:51,696 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:51,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:51,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-29 01:00:51,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804123673] [2020-07-29 01:00:51,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:00:51,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:51,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:00:51,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:51,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:00:51,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:51,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:00:51,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:00:51,742 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2020-07-29 01:00:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:52,263 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2020-07-29 01:00:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:00:52,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-29 01:00:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:00:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-29 01:00:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:00:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-29 01:00:52,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2020-07-29 01:00:52,327 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:52,328 INFO L225 Difference]: With dead ends: 51 [2020-07-29 01:00:52,328 INFO L226 Difference]: Without dead ends: 48 [2020-07-29 01:00:52,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:00:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-29 01:00:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-29 01:00:52,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:52,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2020-07-29 01:00:52,333 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2020-07-29 01:00:52,333 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2020-07-29 01:00:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:52,335 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-29 01:00:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-29 01:00:52,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:52,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:52,336 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2020-07-29 01:00:52,336 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2020-07-29 01:00:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:52,338 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-29 01:00:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-29 01:00:52,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:52,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:52,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:52,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:00:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-07-29 01:00:52,340 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 20 [2020-07-29 01:00:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:52,341 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-07-29 01:00:52,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:00:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-07-29 01:00:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:00:52,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:52,341 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:52,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:52,556 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:52,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:52,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1483602424, now seen corresponding path program 2 times [2020-07-29 01:00:52,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:52,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515530111] [2020-07-29 01:00:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:52,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:52,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {1843#(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; {1835#true} is VALID [2020-07-29 01:00:52,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {1835#true} assume true; {1835#true} is VALID [2020-07-29 01:00:52,636 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1835#true} {1835#true} #74#return; {1835#true} is VALID [2020-07-29 01:00:52,637 INFO L263 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1843#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:52,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {1843#(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; {1835#true} is VALID [2020-07-29 01:00:52,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {1835#true} assume true; {1835#true} is VALID [2020-07-29 01:00:52,638 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1835#true} {1835#true} #74#return; {1835#true} is VALID [2020-07-29 01:00:52,638 INFO L263 TraceCheckUtils]: 4: Hoare triple {1835#true} call #t~ret6 := main(); {1835#true} is VALID [2020-07-29 01:00:52,638 INFO L280 TraceCheckUtils]: 5: Hoare triple {1835#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1835#true} is VALID [2020-07-29 01:00:52,638 INFO L280 TraceCheckUtils]: 6: Hoare triple {1835#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1835#true} is VALID [2020-07-29 01:00:52,638 INFO L263 TraceCheckUtils]: 7: Hoare triple {1835#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1835#true} is VALID [2020-07-29 01:00:52,639 INFO L280 TraceCheckUtils]: 8: Hoare triple {1835#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1840#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:52,639 INFO L280 TraceCheckUtils]: 9: Hoare triple {1840#(= 0 foo_~i~0)} assume !!(~i~0 < ~size); {1840#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:52,640 INFO L280 TraceCheckUtils]: 10: Hoare triple {1840#(= 0 foo_~i~0)} assume 0 <= ~i~0 && ~i~0 < 32; {1840#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:52,640 INFO L280 TraceCheckUtils]: 11: Hoare triple {1840#(= 0 foo_~i~0)} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {1840#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:52,641 INFO L280 TraceCheckUtils]: 12: Hoare triple {1840#(= 0 foo_~i~0)} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1840#(= 0 foo_~i~0)} is VALID [2020-07-29 01:00:52,641 INFO L280 TraceCheckUtils]: 13: Hoare triple {1840#(= 0 foo_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:52,642 INFO L280 TraceCheckUtils]: 14: Hoare triple {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:52,642 INFO L280 TraceCheckUtils]: 15: Hoare triple {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:52,643 INFO L280 TraceCheckUtils]: 16: Hoare triple {1841#(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 {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:52,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:52,644 INFO L280 TraceCheckUtils]: 18: Hoare triple {1841#(and (<= 1 foo_~i~0) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1842#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:52,644 INFO L280 TraceCheckUtils]: 19: Hoare triple {1842#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {1842#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:52,645 INFO L280 TraceCheckUtils]: 20: Hoare triple {1842#(and (<= 2 foo_~i~0) (<= foo_~i~0 2))} assume !(0 <= ~i~0 && ~i~0 < 32); {1836#false} is VALID [2020-07-29 01:00:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:52,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515530111] [2020-07-29 01:00:52,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364838383] [2020-07-29 01:00:52,646 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 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:52,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:00:52,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:52,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:00:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:52,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:52,859 INFO L263 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1835#true} is VALID [2020-07-29 01:00:52,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {1835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1835#true} is VALID [2020-07-29 01:00:52,860 INFO L280 TraceCheckUtils]: 2: Hoare triple {1835#true} assume true; {1835#true} is VALID [2020-07-29 01:00:52,860 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1835#true} {1835#true} #74#return; {1835#true} is VALID [2020-07-29 01:00:52,860 INFO L263 TraceCheckUtils]: 4: Hoare triple {1835#true} call #t~ret6 := main(); {1835#true} is VALID [2020-07-29 01:00:52,861 INFO L280 TraceCheckUtils]: 5: Hoare triple {1835#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {1835#true} is VALID [2020-07-29 01:00:52,861 INFO L280 TraceCheckUtils]: 6: Hoare triple {1835#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {1835#true} is VALID [2020-07-29 01:00:52,862 INFO L263 TraceCheckUtils]: 7: Hoare triple {1835#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {1868#(<= |foo_#in~size| 32)} is VALID [2020-07-29 01:00:52,862 INFO L280 TraceCheckUtils]: 8: Hoare triple {1868#(<= |foo_#in~size| 32)} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {1872#(<= foo_~size 32)} is VALID [2020-07-29 01:00:52,863 INFO L280 TraceCheckUtils]: 9: Hoare triple {1872#(<= foo_~size 32)} assume !!(~i~0 < ~size); {1872#(<= foo_~size 32)} is VALID [2020-07-29 01:00:52,863 INFO L280 TraceCheckUtils]: 10: Hoare triple {1872#(<= foo_~size 32)} assume 0 <= ~i~0 && ~i~0 < 32; {1872#(<= foo_~size 32)} is VALID [2020-07-29 01:00:52,864 INFO L280 TraceCheckUtils]: 11: Hoare triple {1872#(<= foo_~size 32)} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {1872#(<= foo_~size 32)} is VALID [2020-07-29 01:00:52,864 INFO L280 TraceCheckUtils]: 12: Hoare triple {1872#(<= foo_~size 32)} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1872#(<= foo_~size 32)} is VALID [2020-07-29 01:00:52,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {1872#(<= foo_~size 32)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1872#(<= foo_~size 32)} is VALID [2020-07-29 01:00:52,865 INFO L280 TraceCheckUtils]: 14: Hoare triple {1872#(<= foo_~size 32)} assume !!(~i~0 < ~size); {1872#(<= foo_~size 32)} is VALID [2020-07-29 01:00:52,866 INFO L280 TraceCheckUtils]: 15: Hoare triple {1872#(<= foo_~size 32)} assume 0 <= ~i~0 && ~i~0 < 32; {1894#(and (<= 0 foo_~i~0) (<= foo_~size 32))} is VALID [2020-07-29 01:00:52,867 INFO L280 TraceCheckUtils]: 16: Hoare triple {1894#(and (<= 0 foo_~i~0) (<= foo_~size 32))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {1894#(and (<= 0 foo_~i~0) (<= foo_~size 32))} is VALID [2020-07-29 01:00:52,867 INFO L280 TraceCheckUtils]: 17: Hoare triple {1894#(and (<= 0 foo_~i~0) (<= foo_~size 32))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {1894#(and (<= 0 foo_~i~0) (<= foo_~size 32))} is VALID [2020-07-29 01:00:52,869 INFO L280 TraceCheckUtils]: 18: Hoare triple {1894#(and (<= 0 foo_~i~0) (<= foo_~size 32))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1904#(and (<= foo_~size 32) (<= 1 foo_~i~0))} is VALID [2020-07-29 01:00:52,869 INFO L280 TraceCheckUtils]: 19: Hoare triple {1904#(and (<= foo_~size 32) (<= 1 foo_~i~0))} assume !!(~i~0 < ~size); {1908#(and (<= 1 foo_~i~0) (<= foo_~i~0 31))} is VALID [2020-07-29 01:00:52,870 INFO L280 TraceCheckUtils]: 20: Hoare triple {1908#(and (<= 1 foo_~i~0) (<= foo_~i~0 31))} assume !(0 <= ~i~0 && ~i~0 < 32); {1836#false} is VALID [2020-07-29 01:00:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:00:52,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:52,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-07-29 01:00:52,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17512135] [2020-07-29 01:00:52,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-29 01:00:52,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:52,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:00:52,919 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:00:52,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:00:52,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:52,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:00:52,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:00:52,920 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2020-07-29 01:00:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:53,565 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-29 01:00:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:00:53,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-29 01:00:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-29 01:00:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2020-07-29 01:00:53,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2020-07-29 01:00:53,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:53,669 INFO L225 Difference]: With dead ends: 60 [2020-07-29 01:00:53,669 INFO L226 Difference]: Without dead ends: 60 [2020-07-29 01:00:53,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:00:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-29 01:00:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2020-07-29 01:00:53,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:53,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 45 states. [2020-07-29 01:00:53,673 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 45 states. [2020-07-29 01:00:53,673 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 45 states. [2020-07-29 01:00:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:53,676 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-29 01:00:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2020-07-29 01:00:53,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:53,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:53,676 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 60 states. [2020-07-29 01:00:53,676 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 60 states. [2020-07-29 01:00:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:53,679 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-29 01:00:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2020-07-29 01:00:53,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:53,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:53,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:53,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:00:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-29 01:00:53,681 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 21 [2020-07-29 01:00:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:53,681 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-29 01:00:53,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:00:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-29 01:00:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:00:53,682 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:53,682 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:53,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:53,896 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:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:53,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1252965158, now seen corresponding path program 2 times [2020-07-29 01:00:53,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:53,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95925781] [2020-07-29 01:00:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:54,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:54,082 INFO L280 TraceCheckUtils]: 0: Hoare triple {2160#(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; {2148#true} is VALID [2020-07-29 01:00:54,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {2148#true} assume true; {2148#true} is VALID [2020-07-29 01:00:54,083 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2148#true} {2148#true} #74#return; {2148#true} is VALID [2020-07-29 01:00:54,085 INFO L263 TraceCheckUtils]: 0: Hoare triple {2148#true} call ULTIMATE.init(); {2160#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:54,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {2160#(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; {2148#true} is VALID [2020-07-29 01:00:54,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {2148#true} assume true; {2148#true} is VALID [2020-07-29 01:00:54,086 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2148#true} {2148#true} #74#return; {2148#true} is VALID [2020-07-29 01:00:54,086 INFO L263 TraceCheckUtils]: 4: Hoare triple {2148#true} call #t~ret6 := main(); {2148#true} is VALID [2020-07-29 01:00:54,091 INFO L280 TraceCheckUtils]: 5: Hoare triple {2148#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2153#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:54,096 INFO L280 TraceCheckUtils]: 6: Hoare triple {2153#(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; {2154#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:54,098 INFO L263 TraceCheckUtils]: 7: Hoare triple {2154#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {2155#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:54,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {2155#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2156#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,100 INFO L280 TraceCheckUtils]: 9: Hoare triple {2156#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {2156#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,101 INFO L280 TraceCheckUtils]: 10: Hoare triple {2156#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {2156#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {2156#(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 {2156#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,103 INFO L280 TraceCheckUtils]: 12: Hoare triple {2156#(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; {2156#(and (= 32 (select |#length| foo_~b.base)) (= 0 foo_~i~0) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,104 INFO L280 TraceCheckUtils]: 13: Hoare triple {2156#(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; {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:54,105 INFO L280 TraceCheckUtils]: 14: Hoare triple {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:54,106 INFO L280 TraceCheckUtils]: 15: Hoare triple {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:54,107 INFO L280 TraceCheckUtils]: 16: Hoare triple {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:54,108 INFO L280 TraceCheckUtils]: 17: Hoare triple {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:54,109 INFO L280 TraceCheckUtils]: 18: Hoare triple {2157#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2158#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:54,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {2158#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {2158#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:54,110 INFO L280 TraceCheckUtils]: 20: Hoare triple {2158#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 2))} assume 0 <= ~i~0 && ~i~0 < 32; {2159#(and (<= 0 foo_~i~0) (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:54,112 INFO L280 TraceCheckUtils]: 21: Hoare triple {2159#(and (<= 0 foo_~i~0) (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0) (<= foo_~i~0 2))} assume !(1 + (~b.offset + ~i~0) <= #length[~b.base] && 0 <= ~b.offset + ~i~0); {2149#false} is VALID [2020-07-29 01:00:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:54,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95925781] [2020-07-29 01:00:54,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961017599] [2020-07-29 01:00:54,115 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 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:54,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:00:54,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:54,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-29 01:00:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:54,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:54,194 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:54,195 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:54,195 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:54,216 INFO L624 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-29 01:00:54,218 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:54,218 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-07-29 01:00:54,221 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:54,221 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_13|, |main_~#b~0.base|]. (and (= 0 |main_~#mask~0.offset|) (= (store (store |v_#length_13| |main_~#b~0.base| 400) |main_~#mask~0.base| 32) |#length|)) [2020-07-29 01:00:54,221 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|)) [2020-07-29 01:00:54,298 INFO L263 TraceCheckUtils]: 0: Hoare triple {2148#true} call ULTIMATE.init(); {2148#true} is VALID [2020-07-29 01:00:54,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {2148#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2148#true} is VALID [2020-07-29 01:00:54,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {2148#true} assume true; {2148#true} is VALID [2020-07-29 01:00:54,299 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2148#true} {2148#true} #74#return; {2148#true} is VALID [2020-07-29 01:00:54,299 INFO L263 TraceCheckUtils]: 4: Hoare triple {2148#true} call #t~ret6 := main(); {2148#true} is VALID [2020-07-29 01:00:54,301 INFO L280 TraceCheckUtils]: 5: Hoare triple {2148#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2153#(and (= 32 (select |#length| |main_~#mask~0.base|)) (= 0 |main_~#mask~0.offset|))} is VALID [2020-07-29 01:00:54,301 INFO L280 TraceCheckUtils]: 6: Hoare triple {2153#(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; {2154#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} is VALID [2020-07-29 01:00:54,303 INFO L263 TraceCheckUtils]: 7: Hoare triple {2154#(and (= 32 (select |#length| main_~c~0.base)) (= main_~c~0.offset 0))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {2155#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} is VALID [2020-07-29 01:00:54,304 INFO L280 TraceCheckUtils]: 8: Hoare triple {2155#(and (= 32 (select |#length| |foo_#in~b.base|)) (= 0 |foo_#in~b.offset|))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,305 INFO L280 TraceCheckUtils]: 9: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {2188#(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 {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,307 INFO L280 TraceCheckUtils]: 12: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,308 INFO L280 TraceCheckUtils]: 13: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,309 INFO L280 TraceCheckUtils]: 14: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,310 INFO L280 TraceCheckUtils]: 15: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,311 INFO L280 TraceCheckUtils]: 16: Hoare triple {2188#(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 {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,312 INFO L280 TraceCheckUtils]: 17: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,313 INFO L280 TraceCheckUtils]: 18: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,314 INFO L280 TraceCheckUtils]: 19: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume !!(~i~0 < ~size); {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} is VALID [2020-07-29 01:00:54,314 INFO L280 TraceCheckUtils]: 20: Hoare triple {2188#(and (= 32 (select |#length| foo_~b.base)) (= foo_~b.offset 0))} assume 0 <= ~i~0 && ~i~0 < 32; {2225#(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:54,315 INFO L280 TraceCheckUtils]: 21: Hoare triple {2225#(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); {2149#false} is VALID [2020-07-29 01:00:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-29 01:00:54,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:00:54,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2020-07-29 01:00:54,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24195880] [2020-07-29 01:00:54,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-29 01:00:54,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:54,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:00:54,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:54,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-29 01:00:54,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:54,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:00:54,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-29 01:00:54,347 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 7 states. [2020-07-29 01:00:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:54,708 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 01:00:54,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:00:54,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-07-29 01:00:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2020-07-29 01:00:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:00:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2020-07-29 01:00:54,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2020-07-29 01:00:54,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:54,778 INFO L225 Difference]: With dead ends: 44 [2020-07-29 01:00:54,779 INFO L226 Difference]: Without dead ends: 44 [2020-07-29 01:00:54,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:00:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-29 01:00:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-29 01:00:54,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:54,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-29 01:00:54,782 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-29 01:00:54,783 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-29 01:00:54,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:54,785 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 01:00:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 01:00:54,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:54,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:54,785 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-29 01:00:54,786 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-29 01:00:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:54,787 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-29 01:00:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-29 01:00:54,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:54,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:54,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:54,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 01:00:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-07-29 01:00:54,789 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2020-07-29 01:00:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:54,789 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-07-29 01:00:54,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-29 01:00:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-07-29 01:00:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 01:00:54,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:54,790 INFO L422 BasicCegarLoop]: trace histogram [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:54,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-29 01:00:54,998 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:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:54,999 INFO L82 PathProgramCache]: Analyzing trace with hash -523456178, now seen corresponding path program 2 times [2020-07-29 01:00:55,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:55,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637276690] [2020-07-29 01:00:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:55,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:55,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {2428#(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; {2408#true} is VALID [2020-07-29 01:00:55,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {2408#true} assume true; {2408#true} is VALID [2020-07-29 01:00:55,061 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2408#true} {2408#true} #74#return; {2408#true} is VALID [2020-07-29 01:00:55,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:55,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {2408#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,236 INFO L280 TraceCheckUtils]: 2: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,237 INFO L280 TraceCheckUtils]: 3: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,239 INFO L280 TraceCheckUtils]: 4: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,240 INFO L280 TraceCheckUtils]: 5: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,242 INFO L280 TraceCheckUtils]: 6: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,243 INFO L280 TraceCheckUtils]: 7: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,244 INFO L280 TraceCheckUtils]: 8: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,245 INFO L280 TraceCheckUtils]: 9: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2431#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:55,247 INFO L280 TraceCheckUtils]: 11: Hoare triple {2431#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !(~i~0 < ~size); {2432#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:55,248 INFO L280 TraceCheckUtils]: 12: Hoare triple {2432#(not (= 32 |foo_#in~size|))} #res := ~i~0; {2432#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:55,249 INFO L280 TraceCheckUtils]: 13: Hoare triple {2432#(not (= 32 |foo_#in~size|))} assume true; {2432#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:55,250 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2432#(not (= 32 |foo_#in~size|))} {2408#true} #78#return; {2409#false} is VALID [2020-07-29 01:00:55,253 INFO L263 TraceCheckUtils]: 0: Hoare triple {2408#true} call ULTIMATE.init(); {2428#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:55,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {2428#(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; {2408#true} is VALID [2020-07-29 01:00:55,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {2408#true} assume true; {2408#true} is VALID [2020-07-29 01:00:55,254 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2408#true} {2408#true} #74#return; {2408#true} is VALID [2020-07-29 01:00:55,254 INFO L263 TraceCheckUtils]: 4: Hoare triple {2408#true} call #t~ret6 := main(); {2408#true} is VALID [2020-07-29 01:00:55,254 INFO L280 TraceCheckUtils]: 5: Hoare triple {2408#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2408#true} is VALID [2020-07-29 01:00:55,255 INFO L280 TraceCheckUtils]: 6: Hoare triple {2408#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2408#true} is VALID [2020-07-29 01:00:55,255 INFO L263 TraceCheckUtils]: 7: Hoare triple {2408#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {2408#true} is VALID [2020-07-29 01:00:55,257 INFO L280 TraceCheckUtils]: 8: Hoare triple {2408#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,258 INFO L280 TraceCheckUtils]: 9: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,261 INFO L280 TraceCheckUtils]: 12: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:55,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {2429#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,264 INFO L280 TraceCheckUtils]: 16: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:55,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {2430#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2431#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:55,267 INFO L280 TraceCheckUtils]: 19: Hoare triple {2431#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !(~i~0 < ~size); {2432#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:55,267 INFO L280 TraceCheckUtils]: 20: Hoare triple {2432#(not (= 32 |foo_#in~size|))} #res := ~i~0; {2432#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:55,268 INFO L280 TraceCheckUtils]: 21: Hoare triple {2432#(not (= 32 |foo_#in~size|))} assume true; {2432#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:55,269 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2432#(not (= 32 |foo_#in~size|))} {2408#true} #78#return; {2409#false} is VALID [2020-07-29 01:00:55,269 INFO L280 TraceCheckUtils]: 23: Hoare triple {2409#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2409#false} is VALID [2020-07-29 01:00:55,269 INFO L280 TraceCheckUtils]: 24: Hoare triple {2409#false} assume !(1 == #valid[~#b~0.base]); {2409#false} is VALID [2020-07-29 01:00:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:55,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637276690] [2020-07-29 01:00:55,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791103610] [2020-07-29 01:00:55,272 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:00:55,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:00:55,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:55,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:00:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:55,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:55,353 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-29 01:00:55,354 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:55,354 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:55,359 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:55,360 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:55,361 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2020-07-29 01:00:55,362 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:55,363 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_24|, |main_~#mask~0.base|]. (= |#valid| (store (store |v_#valid_24| |main_~#b~0.base| 1) |main_~#mask~0.base| 1)) [2020-07-29 01:00:55,363 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#mask~0.base|]. (and (= 1 (select |#valid| |main_~#mask~0.base|)) (= (select |#valid| |main_~#b~0.base|) 1)) [2020-07-29 01:00:55,529 INFO L263 TraceCheckUtils]: 0: Hoare triple {2408#true} call ULTIMATE.init(); {2408#true} is VALID [2020-07-29 01:00:55,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {2408#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2408#true} is VALID [2020-07-29 01:00:55,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {2408#true} assume true; {2408#true} is VALID [2020-07-29 01:00:55,529 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2408#true} {2408#true} #74#return; {2408#true} is VALID [2020-07-29 01:00:55,529 INFO L263 TraceCheckUtils]: 4: Hoare triple {2408#true} call #t~ret6 := main(); {2408#true} is VALID [2020-07-29 01:00:55,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {2408#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2451#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:55,532 INFO L280 TraceCheckUtils]: 6: Hoare triple {2451#(= (select |#valid| |main_~#b~0.base|) 1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2451#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:55,533 INFO L263 TraceCheckUtils]: 7: Hoare triple {2451#(= (select |#valid| |main_~#b~0.base|) 1)} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} assume !!(~i~0 < ~size); {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,535 INFO L280 TraceCheckUtils]: 10: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} assume 0 <= ~i~0 && ~i~0 < 32; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |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 {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,536 INFO L280 TraceCheckUtils]: 12: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} assume !!(~i~0 < ~size); {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,538 INFO L280 TraceCheckUtils]: 15: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} assume 0 <= ~i~0 && ~i~0 < 32; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,538 INFO L280 TraceCheckUtils]: 16: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |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 {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,539 INFO L280 TraceCheckUtils]: 17: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,539 INFO L280 TraceCheckUtils]: 18: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,540 INFO L280 TraceCheckUtils]: 19: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} assume !(~i~0 < ~size); {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,540 INFO L280 TraceCheckUtils]: 20: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} #res := ~i~0; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,541 INFO L280 TraceCheckUtils]: 21: Hoare triple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} assume true; {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} is VALID [2020-07-29 01:00:55,544 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2458#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_1|)))} {2451#(= (select |#valid| |main_~#b~0.base|) 1)} #78#return; {2451#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:55,545 INFO L280 TraceCheckUtils]: 23: Hoare triple {2451#(= (select |#valid| |main_~#b~0.base|) 1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2451#(= (select |#valid| |main_~#b~0.base|) 1)} is VALID [2020-07-29 01:00:55,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {2451#(= (select |#valid| |main_~#b~0.base|) 1)} assume !(1 == #valid[~#b~0.base]); {2409#false} is VALID [2020-07-29 01:00:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-29 01:00:55,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:00:55,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2020-07-29 01:00:55,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596025156] [2020-07-29 01:00:55,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-29 01:00:55,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:55,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:55,576 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:55,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:55,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:55,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:00:55,577 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2020-07-29 01:00:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:55,658 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-29 01:00:55,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:55,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-29 01:00:55,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-29 01:00:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2020-07-29 01:00:55,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2020-07-29 01:00:55,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:55,702 INFO L225 Difference]: With dead ends: 40 [2020-07-29 01:00:55,703 INFO L226 Difference]: Without dead ends: 40 [2020-07-29 01:00:55,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:00:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-29 01:00:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-29 01:00:55,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:55,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:55,706 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:55,706 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:55,707 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-29 01:00:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-29 01:00:55,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:55,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:55,708 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:55,708 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-29 01:00:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:55,709 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-29 01:00:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-29 01:00:55,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:55,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:55,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:55,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:00:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-29 01:00:55,711 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 25 [2020-07-29 01:00:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:55,712 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-29 01:00:55,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-29 01:00:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 01:00:55,712 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:55,713 INFO L422 BasicCegarLoop]: trace histogram [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:55,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:55,914 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:55,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:55,914 INFO L82 PathProgramCache]: Analyzing trace with hash -523456177, now seen corresponding path program 1 times [2020-07-29 01:00:55,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:55,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825657211] [2020-07-29 01:00:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:55,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:55,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {2689#(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; {2669#true} is VALID [2020-07-29 01:00:55,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-29 01:00:55,961 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2669#true} {2669#true} #74#return; {2669#true} is VALID [2020-07-29 01:00:55,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,125 INFO L280 TraceCheckUtils]: 0: Hoare triple {2669#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,128 INFO L280 TraceCheckUtils]: 3: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,128 INFO L280 TraceCheckUtils]: 4: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,129 INFO L280 TraceCheckUtils]: 5: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,130 INFO L280 TraceCheckUtils]: 6: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,132 INFO L280 TraceCheckUtils]: 8: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,133 INFO L280 TraceCheckUtils]: 9: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,134 INFO L280 TraceCheckUtils]: 10: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2692#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:56,135 INFO L280 TraceCheckUtils]: 11: Hoare triple {2692#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !(~i~0 < ~size); {2693#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:56,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {2693#(not (= 32 |foo_#in~size|))} #res := ~i~0; {2693#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:56,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {2693#(not (= 32 |foo_#in~size|))} assume true; {2693#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:56,139 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2693#(not (= 32 |foo_#in~size|))} {2669#true} #78#return; {2670#false} is VALID [2020-07-29 01:00:56,141 INFO L263 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2689#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:56,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {2689#(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; {2669#true} is VALID [2020-07-29 01:00:56,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-29 01:00:56,141 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #74#return; {2669#true} is VALID [2020-07-29 01:00:56,142 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret6 := main(); {2669#true} is VALID [2020-07-29 01:00:56,142 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2669#true} is VALID [2020-07-29 01:00:56,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {2669#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2669#true} is VALID [2020-07-29 01:00:56,142 INFO L263 TraceCheckUtils]: 7: Hoare triple {2669#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {2669#true} is VALID [2020-07-29 01:00:56,143 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,144 INFO L280 TraceCheckUtils]: 9: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,145 INFO L280 TraceCheckUtils]: 10: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,146 INFO L280 TraceCheckUtils]: 11: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,147 INFO L280 TraceCheckUtils]: 12: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:56,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {2690#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,151 INFO L280 TraceCheckUtils]: 14: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,153 INFO L280 TraceCheckUtils]: 15: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:56,157 INFO L280 TraceCheckUtils]: 18: Hoare triple {2691#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2692#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:56,158 INFO L280 TraceCheckUtils]: 19: Hoare triple {2692#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !(~i~0 < ~size); {2693#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:56,159 INFO L280 TraceCheckUtils]: 20: Hoare triple {2693#(not (= 32 |foo_#in~size|))} #res := ~i~0; {2693#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:56,159 INFO L280 TraceCheckUtils]: 21: Hoare triple {2693#(not (= 32 |foo_#in~size|))} assume true; {2693#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:56,160 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2693#(not (= 32 |foo_#in~size|))} {2669#true} #78#return; {2670#false} is VALID [2020-07-29 01:00:56,161 INFO L280 TraceCheckUtils]: 23: Hoare triple {2670#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2670#false} is VALID [2020-07-29 01:00:56,161 INFO L280 TraceCheckUtils]: 24: Hoare triple {2670#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2670#false} is VALID [2020-07-29 01:00:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:56,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825657211] [2020-07-29 01:00:56,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529632015] [2020-07-29 01:00:56,163 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:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:00:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:56,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:56,403 INFO L263 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2669#true} is VALID [2020-07-29 01:00:56,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {2669#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2669#true} is VALID [2020-07-29 01:00:56,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2020-07-29 01:00:56,404 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #74#return; {2669#true} is VALID [2020-07-29 01:00:56,404 INFO L263 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret6 := main(); {2669#true} is VALID [2020-07-29 01:00:56,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {2669#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2669#true} is VALID [2020-07-29 01:00:56,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {2669#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2669#true} is VALID [2020-07-29 01:00:56,405 INFO L263 TraceCheckUtils]: 7: Hoare triple {2669#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {2669#true} is VALID [2020-07-29 01:00:56,405 INFO L280 TraceCheckUtils]: 8: Hoare triple {2669#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:56,406 INFO L280 TraceCheckUtils]: 9: Hoare triple {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:56,406 INFO L280 TraceCheckUtils]: 10: Hoare triple {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:56,407 INFO L280 TraceCheckUtils]: 11: Hoare triple {2721#(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 {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:56,407 INFO L280 TraceCheckUtils]: 12: Hoare triple {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:56,408 INFO L280 TraceCheckUtils]: 13: Hoare triple {2721#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,408 INFO L280 TraceCheckUtils]: 14: Hoare triple {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,410 INFO L280 TraceCheckUtils]: 16: Hoare triple {2737#(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 {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,410 INFO L280 TraceCheckUtils]: 17: Hoare triple {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:56,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {2737#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2753#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:56,411 INFO L280 TraceCheckUtils]: 19: Hoare triple {2753#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !(~i~0 < ~size); {2757#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:56,412 INFO L280 TraceCheckUtils]: 20: Hoare triple {2757#(<= |foo_#in~size| 2)} #res := ~i~0; {2757#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:56,412 INFO L280 TraceCheckUtils]: 21: Hoare triple {2757#(<= |foo_#in~size| 2)} assume true; {2757#(<= |foo_#in~size| 2)} is VALID [2020-07-29 01:00:56,413 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2757#(<= |foo_#in~size| 2)} {2669#true} #78#return; {2670#false} is VALID [2020-07-29 01:00:56,413 INFO L280 TraceCheckUtils]: 23: Hoare triple {2670#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2670#false} is VALID [2020-07-29 01:00:56,413 INFO L280 TraceCheckUtils]: 24: Hoare triple {2670#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2670#false} is VALID [2020-07-29 01:00:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:56,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:56,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-07-29 01:00:56,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593299043] [2020-07-29 01:00:56,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-29 01:00:56,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:56,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:00:56,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:56,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:00:56,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:00:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:00:56,465 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2020-07-29 01:00:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:57,102 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2020-07-29 01:00:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:00:57,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-07-29 01:00:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2020-07-29 01:00:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:00:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2020-07-29 01:00:57,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2020-07-29 01:00:57,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:57,175 INFO L225 Difference]: With dead ends: 52 [2020-07-29 01:00:57,176 INFO L226 Difference]: Without dead ends: 49 [2020-07-29 01:00:57,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:00:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-29 01:00:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2020-07-29 01:00:57,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:57,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2020-07-29 01:00:57,181 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2020-07-29 01:00:57,182 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2020-07-29 01:00:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:57,183 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-29 01:00:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-29 01:00:57,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:57,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:57,184 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2020-07-29 01:00:57,184 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2020-07-29 01:00:57,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:57,185 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-29 01:00:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-29 01:00:57,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:57,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:57,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:57,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-29 01:00:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-29 01:00:57,187 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 25 [2020-07-29 01:00:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:57,187 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-29 01:00:57,187 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:00:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-29 01:00:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-29 01:00:57,188 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:57,188 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:00:57,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:00:57,392 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:57,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash -661735506, now seen corresponding path program 2 times [2020-07-29 01:00:57,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:57,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332419857] [2020-07-29 01:00:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:57,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:57,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {3000#(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; {2975#true} is VALID [2020-07-29 01:00:57,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {2975#true} assume true; {2975#true} is VALID [2020-07-29 01:00:57,440 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2975#true} {2975#true} #74#return; {2975#true} is VALID [2020-07-29 01:00:57,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:57,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {2975#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,613 INFO L280 TraceCheckUtils]: 1: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,614 INFO L280 TraceCheckUtils]: 2: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,617 INFO L280 TraceCheckUtils]: 5: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,617 INFO L280 TraceCheckUtils]: 6: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,618 INFO L280 TraceCheckUtils]: 7: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,618 INFO L280 TraceCheckUtils]: 8: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,619 INFO L280 TraceCheckUtils]: 9: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,620 INFO L280 TraceCheckUtils]: 10: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,620 INFO L280 TraceCheckUtils]: 11: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,621 INFO L280 TraceCheckUtils]: 12: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,621 INFO L280 TraceCheckUtils]: 13: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,622 INFO L280 TraceCheckUtils]: 14: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,623 INFO L280 TraceCheckUtils]: 15: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3004#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:00:57,623 INFO L280 TraceCheckUtils]: 16: Hoare triple {3004#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !(~i~0 < ~size); {3005#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:57,624 INFO L280 TraceCheckUtils]: 17: Hoare triple {3005#(not (= 32 |foo_#in~size|))} #res := ~i~0; {3005#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:57,624 INFO L280 TraceCheckUtils]: 18: Hoare triple {3005#(not (= 32 |foo_#in~size|))} assume true; {3005#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:57,625 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3005#(not (= 32 |foo_#in~size|))} {2975#true} #78#return; {2976#false} is VALID [2020-07-29 01:00:57,627 INFO L263 TraceCheckUtils]: 0: Hoare triple {2975#true} call ULTIMATE.init(); {3000#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:57,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {3000#(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; {2975#true} is VALID [2020-07-29 01:00:57,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {2975#true} assume true; {2975#true} is VALID [2020-07-29 01:00:57,628 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2975#true} {2975#true} #74#return; {2975#true} is VALID [2020-07-29 01:00:57,628 INFO L263 TraceCheckUtils]: 4: Hoare triple {2975#true} call #t~ret6 := main(); {2975#true} is VALID [2020-07-29 01:00:57,628 INFO L280 TraceCheckUtils]: 5: Hoare triple {2975#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {2975#true} is VALID [2020-07-29 01:00:57,628 INFO L280 TraceCheckUtils]: 6: Hoare triple {2975#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {2975#true} is VALID [2020-07-29 01:00:57,628 INFO L263 TraceCheckUtils]: 7: Hoare triple {2975#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {2975#true} is VALID [2020-07-29 01:00:57,629 INFO L280 TraceCheckUtils]: 8: Hoare triple {2975#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,630 INFO L280 TraceCheckUtils]: 9: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,630 INFO L280 TraceCheckUtils]: 10: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,631 INFO L280 TraceCheckUtils]: 11: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,632 INFO L280 TraceCheckUtils]: 12: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:57,632 INFO L280 TraceCheckUtils]: 13: Hoare triple {3001#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,633 INFO L280 TraceCheckUtils]: 14: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,634 INFO L280 TraceCheckUtils]: 15: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,634 INFO L280 TraceCheckUtils]: 16: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,635 INFO L280 TraceCheckUtils]: 17: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:57,636 INFO L280 TraceCheckUtils]: 18: Hoare triple {3002#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,636 INFO L280 TraceCheckUtils]: 19: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,637 INFO L280 TraceCheckUtils]: 20: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,641 INFO L280 TraceCheckUtils]: 21: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,642 INFO L280 TraceCheckUtils]: 22: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:57,643 INFO L280 TraceCheckUtils]: 23: Hoare triple {3003#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3004#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:00:57,643 INFO L280 TraceCheckUtils]: 24: Hoare triple {3004#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !(~i~0 < ~size); {3005#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:57,644 INFO L280 TraceCheckUtils]: 25: Hoare triple {3005#(not (= 32 |foo_#in~size|))} #res := ~i~0; {3005#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:57,644 INFO L280 TraceCheckUtils]: 26: Hoare triple {3005#(not (= 32 |foo_#in~size|))} assume true; {3005#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:57,645 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3005#(not (= 32 |foo_#in~size|))} {2975#true} #78#return; {2976#false} is VALID [2020-07-29 01:00:57,645 INFO L280 TraceCheckUtils]: 28: Hoare triple {2976#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {2976#false} is VALID [2020-07-29 01:00:57,645 INFO L280 TraceCheckUtils]: 29: Hoare triple {2976#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2976#false} is VALID [2020-07-29 01:00:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:57,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332419857] [2020-07-29 01:00:57,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430459463] [2020-07-29 01:00:57,648 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:57,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:00:57,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:00:57,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:00:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:57,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:57,711 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_14|], 1=[|v_#valid_25|]} [2020-07-29 01:00:57,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:00:57,717 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:57,717 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:57,725 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:57,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:00:57,732 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:57,735 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:00:57,743 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:00:57,745 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:00:57,745 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2020-07-29 01:00:57,747 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:00:57,748 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_14|, |main_~#mask~0.base|, |v_#valid_25|]. (and (= |#length| (store (store |v_#length_14| |main_~#b~0.base| 400) |main_~#mask~0.base| 32)) (<= (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:57,748 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#mask~0.base|]. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|)) [2020-07-29 01:00:58,082 INFO L263 TraceCheckUtils]: 0: Hoare triple {2975#true} call ULTIMATE.init(); {2975#true} is VALID [2020-07-29 01:00:58,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {2975#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2975#true} is VALID [2020-07-29 01:00:58,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {2975#true} assume true; {2975#true} is VALID [2020-07-29 01:00:58,083 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2975#true} {2975#true} #74#return; {2975#true} is VALID [2020-07-29 01:00:58,083 INFO L263 TraceCheckUtils]: 4: Hoare triple {2975#true} call #t~ret6 := main(); {2975#true} is VALID [2020-07-29 01:00:58,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {2975#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:00:58,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:00:58,088 INFO L263 TraceCheckUtils]: 7: Hoare triple {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,089 INFO L280 TraceCheckUtils]: 9: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume !!(~i~0 < ~size); {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume 0 <= ~i~0 && ~i~0 < 32; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,091 INFO L280 TraceCheckUtils]: 11: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,092 INFO L280 TraceCheckUtils]: 12: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,093 INFO L280 TraceCheckUtils]: 13: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,094 INFO L280 TraceCheckUtils]: 14: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume !!(~i~0 < ~size); {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,095 INFO L280 TraceCheckUtils]: 15: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume 0 <= ~i~0 && ~i~0 < 32; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,096 INFO L280 TraceCheckUtils]: 16: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,100 INFO L280 TraceCheckUtils]: 17: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,101 INFO L280 TraceCheckUtils]: 18: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,101 INFO L280 TraceCheckUtils]: 19: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume !!(~i~0 < ~size); {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,102 INFO L280 TraceCheckUtils]: 20: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume 0 <= ~i~0 && ~i~0 < 32; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,103 INFO L280 TraceCheckUtils]: 21: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,103 INFO L280 TraceCheckUtils]: 22: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,104 INFO L280 TraceCheckUtils]: 23: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,105 INFO L280 TraceCheckUtils]: 24: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume !(~i~0 < ~size); {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,106 INFO L280 TraceCheckUtils]: 25: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} #res := ~i~0; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} assume true; {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} is VALID [2020-07-29 01:00:58,111 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3031#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_2|))))} {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} #78#return; {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:00:58,112 INFO L280 TraceCheckUtils]: 28: Hoare triple {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:00:58,113 INFO L280 TraceCheckUtils]: 29: Hoare triple {3024#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {2976#false} is VALID [2020-07-29 01:00:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-29 01:00:58,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:00:58,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2020-07-29 01:00:58,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003341292] [2020-07-29 01:00:58,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-29 01:00:58,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:58,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:00:58,148 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:58,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-29 01:00:58,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:00:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:00:58,149 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2020-07-29 01:00:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:58,284 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-29 01:00:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:00:58,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-29 01:00:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2020-07-29 01:00:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:00:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2020-07-29 01:00:58,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2020-07-29 01:00:58,367 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:58,368 INFO L225 Difference]: With dead ends: 50 [2020-07-29 01:00:58,368 INFO L226 Difference]: Without dead ends: 50 [2020-07-29 01:00:58,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:00:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-29 01:00:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-29 01:00:58,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:00:58,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 48 states. [2020-07-29 01:00:58,373 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 48 states. [2020-07-29 01:00:58,373 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 48 states. [2020-07-29 01:00:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:58,374 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-29 01:00:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-29 01:00:58,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:58,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:58,375 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states. [2020-07-29 01:00:58,375 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states. [2020-07-29 01:00:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:58,377 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-29 01:00:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-07-29 01:00:58,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:00:58,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:00:58,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:00:58,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:00:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:00:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-29 01:00:58,379 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 30 [2020-07-29 01:00:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:00:58,379 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-29 01:00:58,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-29 01:00:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-29 01:00:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-29 01:00:58,380 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:00:58,380 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:58,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-29 01:00:58,595 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:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:00:58,596 INFO L82 PathProgramCache]: Analyzing trace with hash 494772831, now seen corresponding path program 1 times [2020-07-29 01:00:58,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:00:58,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439014008] [2020-07-29 01:00:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:00:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:00:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {3320#(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; {3295#true} is VALID [2020-07-29 01:00:58,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {3295#true} assume true; {3295#true} is VALID [2020-07-29 01:00:58,643 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3295#true} {3295#true} #74#return; {3295#true} is VALID [2020-07-29 01:00:58,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:00:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {3295#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,826 INFO L280 TraceCheckUtils]: 5: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,827 INFO L280 TraceCheckUtils]: 7: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,828 INFO L280 TraceCheckUtils]: 8: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,828 INFO L280 TraceCheckUtils]: 9: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,829 INFO L280 TraceCheckUtils]: 10: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,831 INFO L280 TraceCheckUtils]: 13: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,831 INFO L280 TraceCheckUtils]: 14: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,832 INFO L280 TraceCheckUtils]: 15: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3324#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:00:58,833 INFO L280 TraceCheckUtils]: 16: Hoare triple {3324#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !(~i~0 < ~size); {3325#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:58,833 INFO L280 TraceCheckUtils]: 17: Hoare triple {3325#(not (= 32 |foo_#in~size|))} #res := ~i~0; {3325#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:58,833 INFO L280 TraceCheckUtils]: 18: Hoare triple {3325#(not (= 32 |foo_#in~size|))} assume true; {3325#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:58,834 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3325#(not (= 32 |foo_#in~size|))} {3295#true} #78#return; {3296#false} is VALID [2020-07-29 01:00:58,836 INFO L263 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3320#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:00:58,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {3320#(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; {3295#true} is VALID [2020-07-29 01:00:58,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2020-07-29 01:00:58,836 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #74#return; {3295#true} is VALID [2020-07-29 01:00:58,837 INFO L263 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret6 := main(); {3295#true} is VALID [2020-07-29 01:00:58,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {3295#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3295#true} is VALID [2020-07-29 01:00:58,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {3295#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3295#true} is VALID [2020-07-29 01:00:58,837 INFO L263 TraceCheckUtils]: 7: Hoare triple {3295#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {3295#true} is VALID [2020-07-29 01:00:58,838 INFO L280 TraceCheckUtils]: 8: Hoare triple {3295#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,838 INFO L280 TraceCheckUtils]: 9: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,839 INFO L280 TraceCheckUtils]: 10: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,839 INFO L280 TraceCheckUtils]: 11: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,840 INFO L280 TraceCheckUtils]: 12: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:00:58,840 INFO L280 TraceCheckUtils]: 13: Hoare triple {3321#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,841 INFO L280 TraceCheckUtils]: 14: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,841 INFO L280 TraceCheckUtils]: 15: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,842 INFO L280 TraceCheckUtils]: 16: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,843 INFO L280 TraceCheckUtils]: 17: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:00:58,843 INFO L280 TraceCheckUtils]: 18: Hoare triple {3322#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,844 INFO L280 TraceCheckUtils]: 19: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,844 INFO L280 TraceCheckUtils]: 20: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,845 INFO L280 TraceCheckUtils]: 21: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,845 INFO L280 TraceCheckUtils]: 22: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:00:58,846 INFO L280 TraceCheckUtils]: 23: Hoare triple {3323#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3324#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:00:58,847 INFO L280 TraceCheckUtils]: 24: Hoare triple {3324#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !(~i~0 < ~size); {3325#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:58,847 INFO L280 TraceCheckUtils]: 25: Hoare triple {3325#(not (= 32 |foo_#in~size|))} #res := ~i~0; {3325#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:58,848 INFO L280 TraceCheckUtils]: 26: Hoare triple {3325#(not (= 32 |foo_#in~size|))} assume true; {3325#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:00:58,849 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3325#(not (= 32 |foo_#in~size|))} {3295#true} #78#return; {3296#false} is VALID [2020-07-29 01:00:58,849 INFO L280 TraceCheckUtils]: 28: Hoare triple {3296#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3296#false} is VALID [2020-07-29 01:00:58,849 INFO L280 TraceCheckUtils]: 29: Hoare triple {3296#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3296#false} is VALID [2020-07-29 01:00:58,849 INFO L280 TraceCheckUtils]: 30: Hoare triple {3296#false} havoc #t~ret3; {3296#false} is VALID [2020-07-29 01:00:58,850 INFO L280 TraceCheckUtils]: 31: Hoare triple {3296#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3296#false} is VALID [2020-07-29 01:00:58,850 INFO L280 TraceCheckUtils]: 32: Hoare triple {3296#false} assume !(~i~1 < 32); {3296#false} is VALID [2020-07-29 01:00:58,850 INFO L280 TraceCheckUtils]: 33: Hoare triple {3296#false} ~i~1 := 0; {3296#false} is VALID [2020-07-29 01:00:58,850 INFO L280 TraceCheckUtils]: 34: Hoare triple {3296#false} assume !!(~i~1 < 32); {3296#false} is VALID [2020-07-29 01:00:58,850 INFO L280 TraceCheckUtils]: 35: Hoare triple {3296#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {3296#false} is VALID [2020-07-29 01:00:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:58,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439014008] [2020-07-29 01:00:58,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813583980] [2020-07-29 01:00:58,854 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:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:00:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:00:58,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:00:59,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2020-07-29 01:00:59,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {3295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3295#true} is VALID [2020-07-29 01:00:59,145 INFO L280 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2020-07-29 01:00:59,145 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #74#return; {3295#true} is VALID [2020-07-29 01:00:59,145 INFO L263 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret6 := main(); {3295#true} is VALID [2020-07-29 01:00:59,145 INFO L280 TraceCheckUtils]: 5: Hoare triple {3295#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3295#true} is VALID [2020-07-29 01:00:59,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {3295#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3295#true} is VALID [2020-07-29 01:00:59,146 INFO L263 TraceCheckUtils]: 7: Hoare triple {3295#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {3295#true} is VALID [2020-07-29 01:00:59,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {3295#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,147 INFO L280 TraceCheckUtils]: 9: Hoare triple {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,147 INFO L280 TraceCheckUtils]: 10: Hoare triple {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,148 INFO L280 TraceCheckUtils]: 11: Hoare triple {3353#(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 {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,149 INFO L280 TraceCheckUtils]: 12: Hoare triple {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:00:59,149 INFO L280 TraceCheckUtils]: 13: Hoare triple {3353#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,150 INFO L280 TraceCheckUtils]: 14: Hoare triple {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,150 INFO L280 TraceCheckUtils]: 15: Hoare triple {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,151 INFO L280 TraceCheckUtils]: 16: Hoare triple {3369#(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 {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,151 INFO L280 TraceCheckUtils]: 17: Hoare triple {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:00:59,152 INFO L280 TraceCheckUtils]: 18: Hoare triple {3369#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:59,152 INFO L280 TraceCheckUtils]: 19: Hoare triple {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:59,153 INFO L280 TraceCheckUtils]: 20: Hoare triple {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume 0 <= ~i~0 && ~i~0 < 32; {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:59,153 INFO L280 TraceCheckUtils]: 21: Hoare triple {3385#(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 {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:59,154 INFO L280 TraceCheckUtils]: 22: Hoare triple {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:00:59,154 INFO L280 TraceCheckUtils]: 23: Hoare triple {3385#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3401#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:00:59,155 INFO L280 TraceCheckUtils]: 24: Hoare triple {3401#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume !(~i~0 < ~size); {3405#(<= |foo_#in~size| 3)} is VALID [2020-07-29 01:00:59,155 INFO L280 TraceCheckUtils]: 25: Hoare triple {3405#(<= |foo_#in~size| 3)} #res := ~i~0; {3405#(<= |foo_#in~size| 3)} is VALID [2020-07-29 01:00:59,156 INFO L280 TraceCheckUtils]: 26: Hoare triple {3405#(<= |foo_#in~size| 3)} assume true; {3405#(<= |foo_#in~size| 3)} is VALID [2020-07-29 01:00:59,156 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3405#(<= |foo_#in~size| 3)} {3295#true} #78#return; {3296#false} is VALID [2020-07-29 01:00:59,157 INFO L280 TraceCheckUtils]: 28: Hoare triple {3296#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3296#false} is VALID [2020-07-29 01:00:59,157 INFO L280 TraceCheckUtils]: 29: Hoare triple {3296#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3296#false} is VALID [2020-07-29 01:00:59,157 INFO L280 TraceCheckUtils]: 30: Hoare triple {3296#false} havoc #t~ret3; {3296#false} is VALID [2020-07-29 01:00:59,157 INFO L280 TraceCheckUtils]: 31: Hoare triple {3296#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3296#false} is VALID [2020-07-29 01:00:59,157 INFO L280 TraceCheckUtils]: 32: Hoare triple {3296#false} assume !(~i~1 < 32); {3296#false} is VALID [2020-07-29 01:00:59,157 INFO L280 TraceCheckUtils]: 33: Hoare triple {3296#false} ~i~1 := 0; {3296#false} is VALID [2020-07-29 01:00:59,157 INFO L280 TraceCheckUtils]: 34: Hoare triple {3296#false} assume !!(~i~1 < 32); {3296#false} is VALID [2020-07-29 01:00:59,158 INFO L280 TraceCheckUtils]: 35: Hoare triple {3296#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {3296#false} is VALID [2020-07-29 01:00:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:00:59,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:00:59,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-07-29 01:00:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013589580] [2020-07-29 01:00:59,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2020-07-29 01:00:59,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:00:59,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:00:59,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:00:59,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-29 01:00:59,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:00:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:00:59,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:00:59,228 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 13 states. [2020-07-29 01:00:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:00:59,986 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-29 01:00:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:00:59,986 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2020-07-29 01:00:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:00:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:00:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-29 01:00:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:00:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2020-07-29 01:00:59,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2020-07-29 01:01:00,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:00,075 INFO L225 Difference]: With dead ends: 60 [2020-07-29 01:01:00,075 INFO L226 Difference]: Without dead ends: 57 [2020-07-29 01:01:00,075 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2020-07-29 01:01:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-29 01:01:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2020-07-29 01:01:00,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:00,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2020-07-29 01:01:00,083 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2020-07-29 01:01:00,083 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2020-07-29 01:01:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:00,086 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-07-29 01:01:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-29 01:01:00,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:00,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:00,088 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2020-07-29 01:01:00,088 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2020-07-29 01:01:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:00,091 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2020-07-29 01:01:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-07-29 01:01:00,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:00,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:00,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:00,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-29 01:01:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-07-29 01:01:00,095 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 36 [2020-07-29 01:01:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:00,095 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-07-29 01:01:00,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-29 01:01:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-07-29 01:01:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-29 01:01:00,096 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:00,096 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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:01:00,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:00,312 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:01:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 491272864, now seen corresponding path program 2 times [2020-07-29 01:01:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:00,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397269899] [2020-07-29 01:01:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:00,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:00,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {3707#(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; {3675#true} is VALID [2020-07-29 01:01:00,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {3675#true} assume true; {3675#true} is VALID [2020-07-29 01:01:00,363 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3675#true} {3675#true} #74#return; {3675#true} is VALID [2020-07-29 01:01:00,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:00,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {3675#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3675#true} is VALID [2020-07-29 01:01:00,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,378 INFO L280 TraceCheckUtils]: 3: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,379 INFO L280 TraceCheckUtils]: 5: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,379 INFO L280 TraceCheckUtils]: 6: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,380 INFO L280 TraceCheckUtils]: 12: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,380 INFO L280 TraceCheckUtils]: 13: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,380 INFO L280 TraceCheckUtils]: 15: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,381 INFO L280 TraceCheckUtils]: 16: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,381 INFO L280 TraceCheckUtils]: 17: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,381 INFO L280 TraceCheckUtils]: 18: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,381 INFO L280 TraceCheckUtils]: 19: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,381 INFO L280 TraceCheckUtils]: 20: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,381 INFO L280 TraceCheckUtils]: 21: Hoare triple {3675#true} assume !(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,382 INFO L280 TraceCheckUtils]: 22: Hoare triple {3675#true} #res := ~i~0; {3675#true} is VALID [2020-07-29 01:01:00,382 INFO L280 TraceCheckUtils]: 23: Hoare triple {3675#true} assume true; {3675#true} is VALID [2020-07-29 01:01:00,383 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {3675#true} {3680#(= 0 main_~i~1)} #78#return; {3680#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:00,384 INFO L263 TraceCheckUtils]: 0: Hoare triple {3675#true} call ULTIMATE.init(); {3707#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:00,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {3707#(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; {3675#true} is VALID [2020-07-29 01:01:00,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {3675#true} assume true; {3675#true} is VALID [2020-07-29 01:01:00,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3675#true} {3675#true} #74#return; {3675#true} is VALID [2020-07-29 01:01:00,385 INFO L263 TraceCheckUtils]: 4: Hoare triple {3675#true} call #t~ret6 := main(); {3675#true} is VALID [2020-07-29 01:01:00,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {3675#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3680#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:00,387 INFO L280 TraceCheckUtils]: 6: Hoare triple {3680#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3680#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:00,387 INFO L263 TraceCheckUtils]: 7: Hoare triple {3680#(= 0 main_~i~1)} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {3675#true} is VALID [2020-07-29 01:01:00,387 INFO L280 TraceCheckUtils]: 8: Hoare triple {3675#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3675#true} is VALID [2020-07-29 01:01:00,387 INFO L280 TraceCheckUtils]: 9: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,387 INFO L280 TraceCheckUtils]: 10: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,387 INFO L280 TraceCheckUtils]: 11: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,388 INFO L280 TraceCheckUtils]: 12: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,388 INFO L280 TraceCheckUtils]: 13: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,388 INFO L280 TraceCheckUtils]: 14: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,388 INFO L280 TraceCheckUtils]: 15: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,388 INFO L280 TraceCheckUtils]: 16: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,388 INFO L280 TraceCheckUtils]: 17: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,389 INFO L280 TraceCheckUtils]: 18: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,389 INFO L280 TraceCheckUtils]: 19: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,389 INFO L280 TraceCheckUtils]: 20: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,389 INFO L280 TraceCheckUtils]: 21: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,389 INFO L280 TraceCheckUtils]: 22: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,390 INFO L280 TraceCheckUtils]: 23: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,390 INFO L280 TraceCheckUtils]: 24: Hoare triple {3675#true} assume !!(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,390 INFO L280 TraceCheckUtils]: 25: Hoare triple {3675#true} assume 0 <= ~i~0 && ~i~0 < 32; {3675#true} is VALID [2020-07-29 01:01:00,390 INFO L280 TraceCheckUtils]: 26: Hoare triple {3675#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3675#true} is VALID [2020-07-29 01:01:00,390 INFO L280 TraceCheckUtils]: 27: Hoare triple {3675#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3675#true} is VALID [2020-07-29 01:01:00,390 INFO L280 TraceCheckUtils]: 28: Hoare triple {3675#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3675#true} is VALID [2020-07-29 01:01:00,391 INFO L280 TraceCheckUtils]: 29: Hoare triple {3675#true} assume !(~i~0 < ~size); {3675#true} is VALID [2020-07-29 01:01:00,391 INFO L280 TraceCheckUtils]: 30: Hoare triple {3675#true} #res := ~i~0; {3675#true} is VALID [2020-07-29 01:01:00,391 INFO L280 TraceCheckUtils]: 31: Hoare triple {3675#true} assume true; {3675#true} is VALID [2020-07-29 01:01:00,392 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3675#true} {3680#(= 0 main_~i~1)} #78#return; {3680#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:00,392 INFO L280 TraceCheckUtils]: 33: Hoare triple {3680#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3680#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:00,393 INFO L280 TraceCheckUtils]: 34: Hoare triple {3680#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3680#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:00,393 INFO L280 TraceCheckUtils]: 35: Hoare triple {3680#(= 0 main_~i~1)} havoc #t~ret3; {3680#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:00,394 INFO L280 TraceCheckUtils]: 36: Hoare triple {3680#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3706#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:00,395 INFO L280 TraceCheckUtils]: 37: Hoare triple {3706#(<= main_~i~1 1)} assume !(~i~1 < 32); {3676#false} is VALID [2020-07-29 01:01:00,395 INFO L280 TraceCheckUtils]: 38: Hoare triple {3676#false} ~i~1 := 0; {3676#false} is VALID [2020-07-29 01:01:00,395 INFO L280 TraceCheckUtils]: 39: Hoare triple {3676#false} assume !!(~i~1 < 32); {3676#false} is VALID [2020-07-29 01:01:00,395 INFO L280 TraceCheckUtils]: 40: Hoare triple {3676#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {3676#false} is VALID [2020-07-29 01:01:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-29 01:01:00,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397269899] [2020-07-29 01:01:00,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301728728] [2020-07-29 01:01:00,397 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:01:00,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:01:00,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:01:00,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:01:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:00,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:00,455 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_15|], 1=[|v_#valid_26|]} [2020-07-29 01:01:00,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:01:00,460 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:01:00,461 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:00,471 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:01:00,478 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:01:00,482 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:00,489 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:00,490 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:01:00,491 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2020-07-29 01:01:00,494 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:00,494 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_15|, |main_~#mask~0.base|, |v_#valid_26|]. (and (= |#length| (store (store |v_#length_15| |main_~#b~0.base| 400) |main_~#mask~0.base| 32)) (= 0 |main_~#b~0.offset|) (<= (select (store |v_#valid_26| |main_~#b~0.base| 1) |main_~#mask~0.base|) 0)) [2020-07-29 01:01:00,494 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#mask~0.base|]. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)) [2020-07-29 01:01:00,896 INFO L263 TraceCheckUtils]: 0: Hoare triple {3675#true} call ULTIMATE.init(); {3675#true} is VALID [2020-07-29 01:01:00,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {3675#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3675#true} is VALID [2020-07-29 01:01:00,896 INFO L280 TraceCheckUtils]: 2: Hoare triple {3675#true} assume true; {3675#true} is VALID [2020-07-29 01:01:00,896 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3675#true} {3675#true} #74#return; {3675#true} is VALID [2020-07-29 01:01:00,896 INFO L263 TraceCheckUtils]: 4: Hoare triple {3675#true} call #t~ret6 := main(); {3675#true} is VALID [2020-07-29 01:01:00,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {3675#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,901 INFO L263 TraceCheckUtils]: 7: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,902 INFO L280 TraceCheckUtils]: 9: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume !!(~i~0 < ~size); {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume 0 <= ~i~0 && ~i~0 < 32; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,905 INFO L280 TraceCheckUtils]: 11: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,906 INFO L280 TraceCheckUtils]: 13: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,907 INFO L280 TraceCheckUtils]: 14: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume !!(~i~0 < ~size); {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume 0 <= ~i~0 && ~i~0 < 32; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,910 INFO L280 TraceCheckUtils]: 16: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,911 INFO L280 TraceCheckUtils]: 17: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,912 INFO L280 TraceCheckUtils]: 18: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,913 INFO L280 TraceCheckUtils]: 19: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume !!(~i~0 < ~size); {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,914 INFO L280 TraceCheckUtils]: 20: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume 0 <= ~i~0 && ~i~0 < 32; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,915 INFO L280 TraceCheckUtils]: 21: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,916 INFO L280 TraceCheckUtils]: 22: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,916 INFO L280 TraceCheckUtils]: 23: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,917 INFO L280 TraceCheckUtils]: 24: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume !!(~i~0 < ~size); {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,918 INFO L280 TraceCheckUtils]: 25: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume 0 <= ~i~0 && ~i~0 < 32; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,919 INFO L280 TraceCheckUtils]: 26: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,919 INFO L280 TraceCheckUtils]: 27: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,920 INFO L280 TraceCheckUtils]: 28: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,921 INFO L280 TraceCheckUtils]: 29: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume !(~i~0 < ~size); {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,922 INFO L280 TraceCheckUtils]: 30: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} #res := ~i~0; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,923 INFO L280 TraceCheckUtils]: 31: Hoare triple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} assume true; {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} is VALID [2020-07-29 01:01:00,925 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {3733#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_3|))) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))))} {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} #78#return; {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,926 INFO L280 TraceCheckUtils]: 33: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,927 INFO L280 TraceCheckUtils]: 34: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,928 INFO L280 TraceCheckUtils]: 35: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} havoc #t~ret3; {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,929 INFO L280 TraceCheckUtils]: 36: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,930 INFO L280 TraceCheckUtils]: 37: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} assume !(~i~1 < 32); {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,931 INFO L280 TraceCheckUtils]: 38: Hoare triple {3726#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} ~i~1 := 0; {3827#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,933 INFO L280 TraceCheckUtils]: 39: Hoare triple {3827#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} assume !!(~i~1 < 32); {3827#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:00,934 INFO L280 TraceCheckUtils]: 40: Hoare triple {3827#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 main_~i~1) (= 0 |main_~#b~0.offset|))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {3676#false} is VALID [2020-07-29 01:01:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-29 01:01:00,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:01:00,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2020-07-29 01:01:00,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250475956] [2020-07-29 01:01:00,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-29 01:01:00,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:00,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:01:00,990 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:01:00,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:01:00,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:00,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:01:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:01:00,991 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2020-07-29 01:01:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:01,192 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-07-29 01:01:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:01:01,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-29 01:01:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-29 01:01:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2020-07-29 01:01:01,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2020-07-29 01:01:01,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:01,272 INFO L225 Difference]: With dead ends: 59 [2020-07-29 01:01:01,272 INFO L226 Difference]: Without dead ends: 59 [2020-07-29 01:01:01,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:01:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-29 01:01:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2020-07-29 01:01:01,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:01,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 54 states. [2020-07-29 01:01:01,276 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 54 states. [2020-07-29 01:01:01,276 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 54 states. [2020-07-29 01:01:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:01,278 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-07-29 01:01:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2020-07-29 01:01:01,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:01,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:01,279 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 59 states. [2020-07-29 01:01:01,279 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 59 states. [2020-07-29 01:01:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:01,281 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-07-29 01:01:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2020-07-29 01:01:01,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:01,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:01,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:01,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-29 01:01:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-07-29 01:01:01,284 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 41 [2020-07-29 01:01:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:01,285 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-07-29 01:01:01,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:01:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-07-29 01:01:01,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-29 01:01:01,285 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:01,286 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:01,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-29 01:01:01,500 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:01:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1738652280, now seen corresponding path program 1 times [2020-07-29 01:01:01,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:01,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102579235] [2020-07-29 01:01:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {4096#(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; {4064#true} is VALID [2020-07-29 01:01:01,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {4064#true} assume true; {4064#true} is VALID [2020-07-29 01:01:01,558 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4064#true} {4064#true} #74#return; {4064#true} is VALID [2020-07-29 01:01:01,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {4064#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4064#true} is VALID [2020-07-29 01:01:01,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,575 INFO L280 TraceCheckUtils]: 3: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,576 INFO L280 TraceCheckUtils]: 4: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,576 INFO L280 TraceCheckUtils]: 6: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,576 INFO L280 TraceCheckUtils]: 7: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,577 INFO L280 TraceCheckUtils]: 8: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,577 INFO L280 TraceCheckUtils]: 9: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,577 INFO L280 TraceCheckUtils]: 10: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,577 INFO L280 TraceCheckUtils]: 11: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,578 INFO L280 TraceCheckUtils]: 12: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,578 INFO L280 TraceCheckUtils]: 13: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,578 INFO L280 TraceCheckUtils]: 14: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,578 INFO L280 TraceCheckUtils]: 15: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,578 INFO L280 TraceCheckUtils]: 16: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,579 INFO L280 TraceCheckUtils]: 17: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,579 INFO L280 TraceCheckUtils]: 18: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,579 INFO L280 TraceCheckUtils]: 19: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,579 INFO L280 TraceCheckUtils]: 20: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,580 INFO L280 TraceCheckUtils]: 21: Hoare triple {4064#true} assume !(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,580 INFO L280 TraceCheckUtils]: 22: Hoare triple {4064#true} #res := ~i~0; {4064#true} is VALID [2020-07-29 01:01:01,580 INFO L280 TraceCheckUtils]: 23: Hoare triple {4064#true} assume true; {4064#true} is VALID [2020-07-29 01:01:01,581 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {4064#true} {4069#(= 0 main_~i~1)} #78#return; {4069#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,583 INFO L263 TraceCheckUtils]: 0: Hoare triple {4064#true} call ULTIMATE.init(); {4096#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:01,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {4096#(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; {4064#true} is VALID [2020-07-29 01:01:01,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {4064#true} assume true; {4064#true} is VALID [2020-07-29 01:01:01,584 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4064#true} {4064#true} #74#return; {4064#true} is VALID [2020-07-29 01:01:01,584 INFO L263 TraceCheckUtils]: 4: Hoare triple {4064#true} call #t~ret6 := main(); {4064#true} is VALID [2020-07-29 01:01:01,585 INFO L280 TraceCheckUtils]: 5: Hoare triple {4064#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {4069#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,586 INFO L280 TraceCheckUtils]: 6: Hoare triple {4069#(= 0 main_~i~1)} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4069#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,586 INFO L263 TraceCheckUtils]: 7: Hoare triple {4069#(= 0 main_~i~1)} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {4064#true} is VALID [2020-07-29 01:01:01,586 INFO L280 TraceCheckUtils]: 8: Hoare triple {4064#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4064#true} is VALID [2020-07-29 01:01:01,586 INFO L280 TraceCheckUtils]: 9: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,587 INFO L280 TraceCheckUtils]: 10: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,587 INFO L280 TraceCheckUtils]: 11: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,587 INFO L280 TraceCheckUtils]: 12: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,588 INFO L280 TraceCheckUtils]: 13: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,588 INFO L280 TraceCheckUtils]: 16: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,589 INFO L280 TraceCheckUtils]: 17: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,589 INFO L280 TraceCheckUtils]: 18: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,589 INFO L280 TraceCheckUtils]: 19: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,589 INFO L280 TraceCheckUtils]: 20: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,589 INFO L280 TraceCheckUtils]: 21: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,590 INFO L280 TraceCheckUtils]: 22: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,590 INFO L280 TraceCheckUtils]: 23: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,590 INFO L280 TraceCheckUtils]: 24: Hoare triple {4064#true} assume !!(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,590 INFO L280 TraceCheckUtils]: 25: Hoare triple {4064#true} assume 0 <= ~i~0 && ~i~0 < 32; {4064#true} is VALID [2020-07-29 01:01:01,591 INFO L280 TraceCheckUtils]: 26: Hoare triple {4064#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4064#true} is VALID [2020-07-29 01:01:01,591 INFO L280 TraceCheckUtils]: 27: Hoare triple {4064#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4064#true} is VALID [2020-07-29 01:01:01,591 INFO L280 TraceCheckUtils]: 28: Hoare triple {4064#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4064#true} is VALID [2020-07-29 01:01:01,592 INFO L280 TraceCheckUtils]: 29: Hoare triple {4064#true} assume !(~i~0 < ~size); {4064#true} is VALID [2020-07-29 01:01:01,592 INFO L280 TraceCheckUtils]: 30: Hoare triple {4064#true} #res := ~i~0; {4064#true} is VALID [2020-07-29 01:01:01,592 INFO L280 TraceCheckUtils]: 31: Hoare triple {4064#true} assume true; {4064#true} is VALID [2020-07-29 01:01:01,593 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4064#true} {4069#(= 0 main_~i~1)} #78#return; {4069#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,594 INFO L280 TraceCheckUtils]: 33: Hoare triple {4069#(= 0 main_~i~1)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4069#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,595 INFO L280 TraceCheckUtils]: 34: Hoare triple {4069#(= 0 main_~i~1)} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4069#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,596 INFO L280 TraceCheckUtils]: 35: Hoare triple {4069#(= 0 main_~i~1)} havoc #t~ret3; {4069#(= 0 main_~i~1)} is VALID [2020-07-29 01:01:01,596 INFO L280 TraceCheckUtils]: 36: Hoare triple {4069#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4095#(<= main_~i~1 1)} is VALID [2020-07-29 01:01:01,597 INFO L280 TraceCheckUtils]: 37: Hoare triple {4095#(<= main_~i~1 1)} assume !(~i~1 < 32); {4065#false} is VALID [2020-07-29 01:01:01,597 INFO L280 TraceCheckUtils]: 38: Hoare triple {4065#false} ~i~1 := 0; {4065#false} is VALID [2020-07-29 01:01:01,598 INFO L280 TraceCheckUtils]: 39: Hoare triple {4065#false} assume !!(~i~1 < 32); {4065#false} is VALID [2020-07-29 01:01:01,598 INFO L280 TraceCheckUtils]: 40: Hoare triple {4065#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {4065#false} is VALID [2020-07-29 01:01:01,598 INFO L280 TraceCheckUtils]: 41: Hoare triple {4065#false} assume 32 != #t~mem5;havoc #t~mem5; {4065#false} is VALID [2020-07-29 01:01:01,599 INFO L280 TraceCheckUtils]: 42: Hoare triple {4065#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; {4065#false} is VALID [2020-07-29 01:01:01,599 INFO L280 TraceCheckUtils]: 43: Hoare triple {4065#false} assume !(#valid == old(#valid)); {4065#false} is VALID [2020-07-29 01:01:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-07-29 01:01:01,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102579235] [2020-07-29 01:01:01,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57557667] [2020-07-29 01:01:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:01:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:01:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:01,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:01,968 INFO L263 TraceCheckUtils]: 0: Hoare triple {4064#true} call ULTIMATE.init(); {4064#true} is VALID [2020-07-29 01:01:01,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {4064#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4064#true} is VALID [2020-07-29 01:01:01,969 INFO L280 TraceCheckUtils]: 2: Hoare triple {4064#true} assume true; {4064#true} is VALID [2020-07-29 01:01:01,969 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4064#true} {4064#true} #74#return; {4064#true} is VALID [2020-07-29 01:01:01,969 INFO L263 TraceCheckUtils]: 4: Hoare triple {4064#true} call #t~ret6 := main(); {4064#true} is VALID [2020-07-29 01:01:01,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {4064#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {4064#true} is VALID [2020-07-29 01:01:01,969 INFO L280 TraceCheckUtils]: 6: Hoare triple {4064#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4064#true} is VALID [2020-07-29 01:01:01,969 INFO L263 TraceCheckUtils]: 7: Hoare triple {4064#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {4064#true} is VALID [2020-07-29 01:01:01,970 INFO L280 TraceCheckUtils]: 8: Hoare triple {4064#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:01,970 INFO L280 TraceCheckUtils]: 9: Hoare triple {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:01,971 INFO L280 TraceCheckUtils]: 10: Hoare triple {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:01,972 INFO L280 TraceCheckUtils]: 11: Hoare triple {4124#(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 {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:01,972 INFO L280 TraceCheckUtils]: 12: Hoare triple {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:01,973 INFO L280 TraceCheckUtils]: 13: Hoare triple {4124#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:01,973 INFO L280 TraceCheckUtils]: 14: Hoare triple {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:01,974 INFO L280 TraceCheckUtils]: 15: Hoare triple {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:01,975 INFO L280 TraceCheckUtils]: 16: Hoare triple {4140#(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 {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:01,976 INFO L280 TraceCheckUtils]: 17: Hoare triple {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:01,976 INFO L280 TraceCheckUtils]: 18: Hoare triple {4140#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:01,977 INFO L280 TraceCheckUtils]: 19: Hoare triple {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:01,977 INFO L280 TraceCheckUtils]: 20: Hoare triple {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume 0 <= ~i~0 && ~i~0 < 32; {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:01,978 INFO L280 TraceCheckUtils]: 21: Hoare triple {4156#(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 {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:01,979 INFO L280 TraceCheckUtils]: 22: Hoare triple {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:01,980 INFO L280 TraceCheckUtils]: 23: Hoare triple {4156#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:01,980 INFO L280 TraceCheckUtils]: 24: Hoare triple {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume !!(~i~0 < ~size); {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:01,981 INFO L280 TraceCheckUtils]: 25: Hoare triple {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume 0 <= ~i~0 && ~i~0 < 32; {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:01,982 INFO L280 TraceCheckUtils]: 26: Hoare triple {4172#(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 {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:01,982 INFO L280 TraceCheckUtils]: 27: Hoare triple {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:01,983 INFO L280 TraceCheckUtils]: 28: Hoare triple {4172#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4188#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:01,984 INFO L280 TraceCheckUtils]: 29: Hoare triple {4188#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} assume !(~i~0 < ~size); {4192#(<= |foo_#in~size| 4)} is VALID [2020-07-29 01:01:01,984 INFO L280 TraceCheckUtils]: 30: Hoare triple {4192#(<= |foo_#in~size| 4)} #res := ~i~0; {4192#(<= |foo_#in~size| 4)} is VALID [2020-07-29 01:01:01,986 INFO L280 TraceCheckUtils]: 31: Hoare triple {4192#(<= |foo_#in~size| 4)} assume true; {4192#(<= |foo_#in~size| 4)} is VALID [2020-07-29 01:01:01,987 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {4192#(<= |foo_#in~size| 4)} {4064#true} #78#return; {4065#false} is VALID [2020-07-29 01:01:01,988 INFO L280 TraceCheckUtils]: 33: Hoare triple {4065#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4065#false} is VALID [2020-07-29 01:01:01,988 INFO L280 TraceCheckUtils]: 34: Hoare triple {4065#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4065#false} is VALID [2020-07-29 01:01:01,988 INFO L280 TraceCheckUtils]: 35: Hoare triple {4065#false} havoc #t~ret3; {4065#false} is VALID [2020-07-29 01:01:01,988 INFO L280 TraceCheckUtils]: 36: Hoare triple {4065#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4065#false} is VALID [2020-07-29 01:01:01,988 INFO L280 TraceCheckUtils]: 37: Hoare triple {4065#false} assume !(~i~1 < 32); {4065#false} is VALID [2020-07-29 01:01:01,988 INFO L280 TraceCheckUtils]: 38: Hoare triple {4065#false} ~i~1 := 0; {4065#false} is VALID [2020-07-29 01:01:01,988 INFO L280 TraceCheckUtils]: 39: Hoare triple {4065#false} assume !!(~i~1 < 32); {4065#false} is VALID [2020-07-29 01:01:01,989 INFO L280 TraceCheckUtils]: 40: Hoare triple {4065#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {4065#false} is VALID [2020-07-29 01:01:01,989 INFO L280 TraceCheckUtils]: 41: Hoare triple {4065#false} assume 32 != #t~mem5;havoc #t~mem5; {4065#false} is VALID [2020-07-29 01:01:01,989 INFO L280 TraceCheckUtils]: 42: Hoare triple {4065#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; {4065#false} is VALID [2020-07-29 01:01:01,989 INFO L280 TraceCheckUtils]: 43: Hoare triple {4065#false} assume !(#valid == old(#valid)); {4065#false} is VALID [2020-07-29 01:01:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:01,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:01:01,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2020-07-29 01:01:01,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858419243] [2020-07-29 01:01:01,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-29 01:01:01,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:01,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:01:02,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:02,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-29 01:01:02,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:01:02,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:01:02,068 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 11 states. [2020-07-29 01:01:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:02,886 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-07-29 01:01:02,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:01:02,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-29 01:01:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:01:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2020-07-29 01:01:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:01:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2020-07-29 01:01:02,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2020-07-29 01:01:03,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:03,026 INFO L225 Difference]: With dead ends: 88 [2020-07-29 01:01:03,026 INFO L226 Difference]: Without dead ends: 85 [2020-07-29 01:01:03,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:01:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-29 01:01:03,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 65. [2020-07-29 01:01:03,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:03,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 65 states. [2020-07-29 01:01:03,035 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 65 states. [2020-07-29 01:01:03,035 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 65 states. [2020-07-29 01:01:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:03,039 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2020-07-29 01:01:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2020-07-29 01:01:03,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:03,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:03,040 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 85 states. [2020-07-29 01:01:03,040 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 85 states. [2020-07-29 01:01:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:03,043 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2020-07-29 01:01:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2020-07-29 01:01:03,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:03,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:03,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:03,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-29 01:01:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2020-07-29 01:01:03,047 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 44 [2020-07-29 01:01:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:03,047 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2020-07-29 01:01:03,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-29 01:01:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2020-07-29 01:01:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-07-29 01:01:03,049 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:03,049 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:03,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-29 01:01:03,264 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:01:03,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash -453177461, now seen corresponding path program 1 times [2020-07-29 01:01:03,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:03,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61192151] [2020-07-29 01:01:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:03,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:03,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {4634#(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; {4569#true} is VALID [2020-07-29 01:01:03,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {4569#true} assume true; {4569#true} is VALID [2020-07-29 01:01:03,307 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4569#true} {4569#true} #74#return; {4569#true} is VALID [2020-07-29 01:01:03,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:03,569 INFO L280 TraceCheckUtils]: 0: Hoare triple {4569#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,571 INFO L280 TraceCheckUtils]: 2: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,576 INFO L280 TraceCheckUtils]: 3: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,587 INFO L280 TraceCheckUtils]: 5: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,587 INFO L280 TraceCheckUtils]: 6: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,588 INFO L280 TraceCheckUtils]: 7: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,591 INFO L280 TraceCheckUtils]: 10: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,592 INFO L280 TraceCheckUtils]: 11: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,592 INFO L280 TraceCheckUtils]: 12: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,593 INFO L280 TraceCheckUtils]: 13: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,594 INFO L280 TraceCheckUtils]: 14: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,595 INFO L280 TraceCheckUtils]: 15: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,596 INFO L280 TraceCheckUtils]: 16: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,597 INFO L280 TraceCheckUtils]: 17: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,598 INFO L280 TraceCheckUtils]: 18: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,598 INFO L280 TraceCheckUtils]: 19: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,599 INFO L280 TraceCheckUtils]: 20: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,600 INFO L280 TraceCheckUtils]: 21: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,601 INFO L280 TraceCheckUtils]: 22: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,602 INFO L280 TraceCheckUtils]: 23: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,603 INFO L280 TraceCheckUtils]: 24: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,604 INFO L280 TraceCheckUtils]: 25: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4640#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:03,604 INFO L280 TraceCheckUtils]: 26: Hoare triple {4640#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !(~i~0 < ~size); {4641#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:03,605 INFO L280 TraceCheckUtils]: 27: Hoare triple {4641#(not (= 32 |foo_#in~size|))} #res := ~i~0; {4641#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:03,606 INFO L280 TraceCheckUtils]: 28: Hoare triple {4641#(not (= 32 |foo_#in~size|))} assume true; {4641#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:03,607 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {4641#(not (= 32 |foo_#in~size|))} {4569#true} #78#return; {4570#false} is VALID [2020-07-29 01:01:03,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-07-29 01:01:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:03,622 INFO L280 TraceCheckUtils]: 0: Hoare triple {4569#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4569#true} is VALID [2020-07-29 01:01:03,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,623 INFO L280 TraceCheckUtils]: 6: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,625 INFO L280 TraceCheckUtils]: 13: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,625 INFO L280 TraceCheckUtils]: 14: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,626 INFO L280 TraceCheckUtils]: 16: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,626 INFO L280 TraceCheckUtils]: 17: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,626 INFO L280 TraceCheckUtils]: 18: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,626 INFO L280 TraceCheckUtils]: 19: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,627 INFO L280 TraceCheckUtils]: 20: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,627 INFO L280 TraceCheckUtils]: 22: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,627 INFO L280 TraceCheckUtils]: 23: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,628 INFO L280 TraceCheckUtils]: 24: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,628 INFO L280 TraceCheckUtils]: 25: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,628 INFO L280 TraceCheckUtils]: 26: Hoare triple {4569#true} assume !(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,628 INFO L280 TraceCheckUtils]: 27: Hoare triple {4569#true} #res := ~i~0; {4569#true} is VALID [2020-07-29 01:01:03,629 INFO L280 TraceCheckUtils]: 28: Hoare triple {4569#true} assume true; {4569#true} is VALID [2020-07-29 01:01:03,629 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {4569#true} {4570#false} #78#return; {4570#false} is VALID [2020-07-29 01:01:03,631 INFO L263 TraceCheckUtils]: 0: Hoare triple {4569#true} call ULTIMATE.init(); {4634#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:03,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {4634#(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; {4569#true} is VALID [2020-07-29 01:01:03,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {4569#true} assume true; {4569#true} is VALID [2020-07-29 01:01:03,631 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4569#true} {4569#true} #74#return; {4569#true} is VALID [2020-07-29 01:01:03,631 INFO L263 TraceCheckUtils]: 4: Hoare triple {4569#true} call #t~ret6 := main(); {4569#true} is VALID [2020-07-29 01:01:03,632 INFO L280 TraceCheckUtils]: 5: Hoare triple {4569#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {4569#true} is VALID [2020-07-29 01:01:03,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {4569#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4569#true} is VALID [2020-07-29 01:01:03,632 INFO L263 TraceCheckUtils]: 7: Hoare triple {4569#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {4569#true} is VALID [2020-07-29 01:01:03,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {4569#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,634 INFO L280 TraceCheckUtils]: 9: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,634 INFO L280 TraceCheckUtils]: 10: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,637 INFO L280 TraceCheckUtils]: 13: Hoare triple {4635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,638 INFO L280 TraceCheckUtils]: 14: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,639 INFO L280 TraceCheckUtils]: 16: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,640 INFO L280 TraceCheckUtils]: 17: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:03,641 INFO L280 TraceCheckUtils]: 18: Hoare triple {4636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,642 INFO L280 TraceCheckUtils]: 19: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,643 INFO L280 TraceCheckUtils]: 20: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,644 INFO L280 TraceCheckUtils]: 21: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,644 INFO L280 TraceCheckUtils]: 22: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:03,645 INFO L280 TraceCheckUtils]: 23: Hoare triple {4637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,646 INFO L280 TraceCheckUtils]: 24: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,647 INFO L280 TraceCheckUtils]: 25: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,648 INFO L280 TraceCheckUtils]: 26: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,648 INFO L280 TraceCheckUtils]: 27: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:03,649 INFO L280 TraceCheckUtils]: 28: Hoare triple {4638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,650 INFO L280 TraceCheckUtils]: 29: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,651 INFO L280 TraceCheckUtils]: 30: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,652 INFO L280 TraceCheckUtils]: 31: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,652 INFO L280 TraceCheckUtils]: 32: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:03,653 INFO L280 TraceCheckUtils]: 33: Hoare triple {4639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4640#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:03,653 INFO L280 TraceCheckUtils]: 34: Hoare triple {4640#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !(~i~0 < ~size); {4641#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:03,654 INFO L280 TraceCheckUtils]: 35: Hoare triple {4641#(not (= 32 |foo_#in~size|))} #res := ~i~0; {4641#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:03,655 INFO L280 TraceCheckUtils]: 36: Hoare triple {4641#(not (= 32 |foo_#in~size|))} assume true; {4641#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:03,656 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {4641#(not (= 32 |foo_#in~size|))} {4569#true} #78#return; {4570#false} is VALID [2020-07-29 01:01:03,656 INFO L280 TraceCheckUtils]: 38: Hoare triple {4570#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4570#false} is VALID [2020-07-29 01:01:03,656 INFO L280 TraceCheckUtils]: 39: Hoare triple {4570#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4570#false} is VALID [2020-07-29 01:01:03,656 INFO L280 TraceCheckUtils]: 40: Hoare triple {4570#false} havoc #t~ret3; {4570#false} is VALID [2020-07-29 01:01:03,656 INFO L280 TraceCheckUtils]: 41: Hoare triple {4570#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4570#false} is VALID [2020-07-29 01:01:03,657 INFO L280 TraceCheckUtils]: 42: Hoare triple {4570#false} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4570#false} is VALID [2020-07-29 01:01:03,657 INFO L263 TraceCheckUtils]: 43: Hoare triple {4570#false} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {4569#true} is VALID [2020-07-29 01:01:03,657 INFO L280 TraceCheckUtils]: 44: Hoare triple {4569#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4569#true} is VALID [2020-07-29 01:01:03,657 INFO L280 TraceCheckUtils]: 45: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,657 INFO L280 TraceCheckUtils]: 46: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,657 INFO L280 TraceCheckUtils]: 47: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,658 INFO L280 TraceCheckUtils]: 48: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,658 INFO L280 TraceCheckUtils]: 49: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,658 INFO L280 TraceCheckUtils]: 50: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,658 INFO L280 TraceCheckUtils]: 51: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,658 INFO L280 TraceCheckUtils]: 52: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,658 INFO L280 TraceCheckUtils]: 53: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,659 INFO L280 TraceCheckUtils]: 54: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,659 INFO L280 TraceCheckUtils]: 55: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,659 INFO L280 TraceCheckUtils]: 56: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,660 INFO L280 TraceCheckUtils]: 57: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,660 INFO L280 TraceCheckUtils]: 58: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,660 INFO L280 TraceCheckUtils]: 59: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,660 INFO L280 TraceCheckUtils]: 60: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,660 INFO L280 TraceCheckUtils]: 61: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,661 INFO L280 TraceCheckUtils]: 62: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,661 INFO L280 TraceCheckUtils]: 63: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,661 INFO L280 TraceCheckUtils]: 64: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,661 INFO L280 TraceCheckUtils]: 65: Hoare triple {4569#true} assume !!(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,661 INFO L280 TraceCheckUtils]: 66: Hoare triple {4569#true} assume 0 <= ~i~0 && ~i~0 < 32; {4569#true} is VALID [2020-07-29 01:01:03,661 INFO L280 TraceCheckUtils]: 67: Hoare triple {4569#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4569#true} is VALID [2020-07-29 01:01:03,661 INFO L280 TraceCheckUtils]: 68: Hoare triple {4569#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4569#true} is VALID [2020-07-29 01:01:03,662 INFO L280 TraceCheckUtils]: 69: Hoare triple {4569#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4569#true} is VALID [2020-07-29 01:01:03,662 INFO L280 TraceCheckUtils]: 70: Hoare triple {4569#true} assume !(~i~0 < ~size); {4569#true} is VALID [2020-07-29 01:01:03,662 INFO L280 TraceCheckUtils]: 71: Hoare triple {4569#true} #res := ~i~0; {4569#true} is VALID [2020-07-29 01:01:03,663 INFO L280 TraceCheckUtils]: 72: Hoare triple {4569#true} assume true; {4569#true} is VALID [2020-07-29 01:01:03,663 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {4569#true} {4570#false} #78#return; {4570#false} is VALID [2020-07-29 01:01:03,663 INFO L280 TraceCheckUtils]: 74: Hoare triple {4570#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4570#false} is VALID [2020-07-29 01:01:03,663 INFO L280 TraceCheckUtils]: 75: Hoare triple {4570#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {4570#false} is VALID [2020-07-29 01:01:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 2 proven. 194 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-07-29 01:01:03,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61192151] [2020-07-29 01:01:03,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427277855] [2020-07-29 01:01:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:01:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:03,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:01:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:03,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:04,148 INFO L263 TraceCheckUtils]: 0: Hoare triple {4569#true} call ULTIMATE.init(); {4569#true} is VALID [2020-07-29 01:01:04,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {4569#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {4569#true} is VALID [2020-07-29 01:01:04,148 INFO L280 TraceCheckUtils]: 2: Hoare triple {4569#true} assume true; {4569#true} is VALID [2020-07-29 01:01:04,148 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4569#true} {4569#true} #74#return; {4569#true} is VALID [2020-07-29 01:01:04,149 INFO L263 TraceCheckUtils]: 4: Hoare triple {4569#true} call #t~ret6 := main(); {4569#true} is VALID [2020-07-29 01:01:04,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {4569#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {4569#true} is VALID [2020-07-29 01:01:04,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {4569#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4569#true} is VALID [2020-07-29 01:01:04,149 INFO L263 TraceCheckUtils]: 7: Hoare triple {4569#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {4569#true} is VALID [2020-07-29 01:01:04,150 INFO L280 TraceCheckUtils]: 8: Hoare triple {4569#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,150 INFO L280 TraceCheckUtils]: 9: Hoare triple {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,151 INFO L280 TraceCheckUtils]: 11: Hoare triple {4669#(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 {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {4669#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:04,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:04,153 INFO L280 TraceCheckUtils]: 15: Hoare triple {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:04,154 INFO L280 TraceCheckUtils]: 16: Hoare triple {4685#(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 {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:04,154 INFO L280 TraceCheckUtils]: 17: Hoare triple {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:04,155 INFO L280 TraceCheckUtils]: 18: Hoare triple {4685#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:04,156 INFO L280 TraceCheckUtils]: 19: Hoare triple {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:04,156 INFO L280 TraceCheckUtils]: 20: Hoare triple {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume 0 <= ~i~0 && ~i~0 < 32; {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:04,157 INFO L280 TraceCheckUtils]: 21: Hoare triple {4701#(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 {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:04,166 INFO L280 TraceCheckUtils]: 22: Hoare triple {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:04,167 INFO L280 TraceCheckUtils]: 23: Hoare triple {4701#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:04,168 INFO L280 TraceCheckUtils]: 24: Hoare triple {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume !!(~i~0 < ~size); {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:04,168 INFO L280 TraceCheckUtils]: 25: Hoare triple {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume 0 <= ~i~0 && ~i~0 < 32; {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:04,169 INFO L280 TraceCheckUtils]: 26: Hoare triple {4717#(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 {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:04,170 INFO L280 TraceCheckUtils]: 27: Hoare triple {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:04,170 INFO L280 TraceCheckUtils]: 28: Hoare triple {4717#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,171 INFO L280 TraceCheckUtils]: 29: Hoare triple {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,171 INFO L280 TraceCheckUtils]: 30: Hoare triple {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,172 INFO L280 TraceCheckUtils]: 31: Hoare triple {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,172 INFO L280 TraceCheckUtils]: 32: Hoare triple {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:04,173 INFO L280 TraceCheckUtils]: 33: Hoare triple {4733#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4749#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} is VALID [2020-07-29 01:01:04,174 INFO L280 TraceCheckUtils]: 34: Hoare triple {4749#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} assume !(~i~0 < ~size); {4753#(<= |foo_#in~size| 5)} is VALID [2020-07-29 01:01:04,174 INFO L280 TraceCheckUtils]: 35: Hoare triple {4753#(<= |foo_#in~size| 5)} #res := ~i~0; {4753#(<= |foo_#in~size| 5)} is VALID [2020-07-29 01:01:04,174 INFO L280 TraceCheckUtils]: 36: Hoare triple {4753#(<= |foo_#in~size| 5)} assume true; {4753#(<= |foo_#in~size| 5)} is VALID [2020-07-29 01:01:04,175 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {4753#(<= |foo_#in~size| 5)} {4569#true} #78#return; {4570#false} is VALID [2020-07-29 01:01:04,175 INFO L280 TraceCheckUtils]: 38: Hoare triple {4570#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4570#false} is VALID [2020-07-29 01:01:04,176 INFO L280 TraceCheckUtils]: 39: Hoare triple {4570#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {4570#false} is VALID [2020-07-29 01:01:04,176 INFO L280 TraceCheckUtils]: 40: Hoare triple {4570#false} havoc #t~ret3; {4570#false} is VALID [2020-07-29 01:01:04,176 INFO L280 TraceCheckUtils]: 41: Hoare triple {4570#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {4570#false} is VALID [2020-07-29 01:01:04,176 INFO L280 TraceCheckUtils]: 42: Hoare triple {4570#false} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {4570#false} is VALID [2020-07-29 01:01:04,176 INFO L263 TraceCheckUtils]: 43: Hoare triple {4570#false} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {4570#false} is VALID [2020-07-29 01:01:04,176 INFO L280 TraceCheckUtils]: 44: Hoare triple {4570#false} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {4570#false} is VALID [2020-07-29 01:01:04,176 INFO L280 TraceCheckUtils]: 45: Hoare triple {4570#false} assume !!(~i~0 < ~size); {4570#false} is VALID [2020-07-29 01:01:04,177 INFO L280 TraceCheckUtils]: 46: Hoare triple {4570#false} assume 0 <= ~i~0 && ~i~0 < 32; {4570#false} is VALID [2020-07-29 01:01:04,177 INFO L280 TraceCheckUtils]: 47: Hoare triple {4570#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4570#false} is VALID [2020-07-29 01:01:04,177 INFO L280 TraceCheckUtils]: 48: Hoare triple {4570#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4570#false} is VALID [2020-07-29 01:01:04,177 INFO L280 TraceCheckUtils]: 49: Hoare triple {4570#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4570#false} is VALID [2020-07-29 01:01:04,177 INFO L280 TraceCheckUtils]: 50: Hoare triple {4570#false} assume !!(~i~0 < ~size); {4570#false} is VALID [2020-07-29 01:01:04,178 INFO L280 TraceCheckUtils]: 51: Hoare triple {4570#false} assume 0 <= ~i~0 && ~i~0 < 32; {4570#false} is VALID [2020-07-29 01:01:04,178 INFO L280 TraceCheckUtils]: 52: Hoare triple {4570#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4570#false} is VALID [2020-07-29 01:01:04,178 INFO L280 TraceCheckUtils]: 53: Hoare triple {4570#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4570#false} is VALID [2020-07-29 01:01:04,178 INFO L280 TraceCheckUtils]: 54: Hoare triple {4570#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4570#false} is VALID [2020-07-29 01:01:04,178 INFO L280 TraceCheckUtils]: 55: Hoare triple {4570#false} assume !!(~i~0 < ~size); {4570#false} is VALID [2020-07-29 01:01:04,178 INFO L280 TraceCheckUtils]: 56: Hoare triple {4570#false} assume 0 <= ~i~0 && ~i~0 < 32; {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 57: Hoare triple {4570#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 58: Hoare triple {4570#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 59: Hoare triple {4570#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 60: Hoare triple {4570#false} assume !!(~i~0 < ~size); {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 61: Hoare triple {4570#false} assume 0 <= ~i~0 && ~i~0 < 32; {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 62: Hoare triple {4570#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 63: Hoare triple {4570#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4570#false} is VALID [2020-07-29 01:01:04,179 INFO L280 TraceCheckUtils]: 64: Hoare triple {4570#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4570#false} is VALID [2020-07-29 01:01:04,180 INFO L280 TraceCheckUtils]: 65: Hoare triple {4570#false} assume !!(~i~0 < ~size); {4570#false} is VALID [2020-07-29 01:01:04,180 INFO L280 TraceCheckUtils]: 66: Hoare triple {4570#false} assume 0 <= ~i~0 && ~i~0 < 32; {4570#false} is VALID [2020-07-29 01:01:04,180 INFO L280 TraceCheckUtils]: 67: Hoare triple {4570#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {4570#false} is VALID [2020-07-29 01:01:04,180 INFO L280 TraceCheckUtils]: 68: Hoare triple {4570#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {4570#false} is VALID [2020-07-29 01:01:04,180 INFO L280 TraceCheckUtils]: 69: Hoare triple {4570#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {4570#false} is VALID [2020-07-29 01:01:04,180 INFO L280 TraceCheckUtils]: 70: Hoare triple {4570#false} assume !(~i~0 < ~size); {4570#false} is VALID [2020-07-29 01:01:04,180 INFO L280 TraceCheckUtils]: 71: Hoare triple {4570#false} #res := ~i~0; {4570#false} is VALID [2020-07-29 01:01:04,181 INFO L280 TraceCheckUtils]: 72: Hoare triple {4570#false} assume true; {4570#false} is VALID [2020-07-29 01:01:04,181 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {4570#false} {4570#false} #78#return; {4570#false} is VALID [2020-07-29 01:01:04,181 INFO L280 TraceCheckUtils]: 74: Hoare triple {4570#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {4570#false} is VALID [2020-07-29 01:01:04,181 INFO L280 TraceCheckUtils]: 75: Hoare triple {4570#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {4570#false} is VALID [2020-07-29 01:01:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 142 proven. 55 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-07-29 01:01:04,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:01:04,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-29 01:01:04,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136411245] [2020-07-29 01:01:04,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2020-07-29 01:01:04,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:04,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-29 01:01:04,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:04,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-29 01:01:04,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-29 01:01:04,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:01:04,309 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 17 states. [2020-07-29 01:01:05,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:05,230 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-29 01:01:05,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:01:05,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2020-07-29 01:01:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:01:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2020-07-29 01:01:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 01:01:05,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2020-07-29 01:01:05,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2020-07-29 01:01:05,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:05,329 INFO L225 Difference]: With dead ends: 77 [2020-07-29 01:01:05,330 INFO L226 Difference]: Without dead ends: 74 [2020-07-29 01:01:05,330 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2020-07-29 01:01:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-29 01:01:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-07-29 01:01:05,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:05,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 70 states. [2020-07-29 01:01:05,338 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 70 states. [2020-07-29 01:01:05,339 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 70 states. [2020-07-29 01:01:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:05,341 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-29 01:01:05,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-29 01:01:05,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:05,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:05,342 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 74 states. [2020-07-29 01:01:05,342 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 74 states. [2020-07-29 01:01:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:05,350 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-29 01:01:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-29 01:01:05,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:05,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:05,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:05,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-29 01:01:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2020-07-29 01:01:05,359 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 76 [2020-07-29 01:01:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:05,360 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2020-07-29 01:01:05,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-29 01:01:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2020-07-29 01:01:05,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-29 01:01:05,362 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:05,362 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:05,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-29 01:01:05,576 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:01:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash -197968815, now seen corresponding path program 2 times [2020-07-29 01:01:05,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:05,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512293886] [2020-07-29 01:01:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:05,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:05,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {5260#(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; {5185#true} is VALID [2020-07-29 01:01:05,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {5185#true} assume true; {5185#true} is VALID [2020-07-29 01:01:05,619 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5185#true} {5185#true} #74#return; {5185#true} is VALID [2020-07-29 01:01:05,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:05,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {5185#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:05,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:05,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:05,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:05,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:05,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:05,960 INFO L280 TraceCheckUtils]: 11: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:05,960 INFO L280 TraceCheckUtils]: 12: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:05,961 INFO L280 TraceCheckUtils]: 13: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:05,961 INFO L280 TraceCheckUtils]: 14: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:05,962 INFO L280 TraceCheckUtils]: 15: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:05,963 INFO L280 TraceCheckUtils]: 16: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:05,963 INFO L280 TraceCheckUtils]: 17: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:05,964 INFO L280 TraceCheckUtils]: 18: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:05,964 INFO L280 TraceCheckUtils]: 19: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:05,965 INFO L280 TraceCheckUtils]: 20: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,965 INFO L280 TraceCheckUtils]: 21: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,966 INFO L280 TraceCheckUtils]: 22: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,967 INFO L280 TraceCheckUtils]: 23: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,967 INFO L280 TraceCheckUtils]: 24: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:05,968 INFO L280 TraceCheckUtils]: 25: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:05,968 INFO L280 TraceCheckUtils]: 26: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !!(~i~0 < ~size); {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:05,969 INFO L280 TraceCheckUtils]: 27: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume 0 <= ~i~0 && ~i~0 < 32; {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:05,970 INFO L280 TraceCheckUtils]: 28: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:05,971 INFO L280 TraceCheckUtils]: 29: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:05,972 INFO L280 TraceCheckUtils]: 30: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5267#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:05,972 INFO L280 TraceCheckUtils]: 31: Hoare triple {5267#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume !(~i~0 < ~size); {5268#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:05,973 INFO L280 TraceCheckUtils]: 32: Hoare triple {5268#(not (= 32 |foo_#in~size|))} #res := ~i~0; {5268#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:05,973 INFO L280 TraceCheckUtils]: 33: Hoare triple {5268#(not (= 32 |foo_#in~size|))} assume true; {5268#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:05,974 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {5268#(not (= 32 |foo_#in~size|))} {5185#true} #78#return; {5186#false} is VALID [2020-07-29 01:01:05,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-07-29 01:01:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:05,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {5185#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5185#true} is VALID [2020-07-29 01:01:05,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:05,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:05,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:05,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:05,997 INFO L280 TraceCheckUtils]: 5: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:05,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:05,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:05,998 INFO L280 TraceCheckUtils]: 8: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:05,999 INFO L280 TraceCheckUtils]: 9: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:05,999 INFO L280 TraceCheckUtils]: 10: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:05,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:05,999 INFO L280 TraceCheckUtils]: 12: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:05,999 INFO L280 TraceCheckUtils]: 13: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:05,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,000 INFO L280 TraceCheckUtils]: 16: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,000 INFO L280 TraceCheckUtils]: 17: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,001 INFO L280 TraceCheckUtils]: 18: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,001 INFO L280 TraceCheckUtils]: 19: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,001 INFO L280 TraceCheckUtils]: 20: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,001 INFO L280 TraceCheckUtils]: 21: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,001 INFO L280 TraceCheckUtils]: 22: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,001 INFO L280 TraceCheckUtils]: 23: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,002 INFO L280 TraceCheckUtils]: 24: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,002 INFO L280 TraceCheckUtils]: 25: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,002 INFO L280 TraceCheckUtils]: 26: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,003 INFO L280 TraceCheckUtils]: 27: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,003 INFO L280 TraceCheckUtils]: 28: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,003 INFO L280 TraceCheckUtils]: 29: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,003 INFO L280 TraceCheckUtils]: 30: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,004 INFO L280 TraceCheckUtils]: 31: Hoare triple {5185#true} assume !(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,004 INFO L280 TraceCheckUtils]: 32: Hoare triple {5185#true} #res := ~i~0; {5185#true} is VALID [2020-07-29 01:01:06,004 INFO L280 TraceCheckUtils]: 33: Hoare triple {5185#true} assume true; {5185#true} is VALID [2020-07-29 01:01:06,004 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {5185#true} {5186#false} #78#return; {5186#false} is VALID [2020-07-29 01:01:06,006 INFO L263 TraceCheckUtils]: 0: Hoare triple {5185#true} call ULTIMATE.init(); {5260#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:06,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {5260#(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; {5185#true} is VALID [2020-07-29 01:01:06,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {5185#true} assume true; {5185#true} is VALID [2020-07-29 01:01:06,007 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5185#true} {5185#true} #74#return; {5185#true} is VALID [2020-07-29 01:01:06,007 INFO L263 TraceCheckUtils]: 4: Hoare triple {5185#true} call #t~ret6 := main(); {5185#true} is VALID [2020-07-29 01:01:06,007 INFO L280 TraceCheckUtils]: 5: Hoare triple {5185#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {5185#true} is VALID [2020-07-29 01:01:06,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {5185#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5185#true} is VALID [2020-07-29 01:01:06,008 INFO L263 TraceCheckUtils]: 7: Hoare triple {5185#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5185#true} is VALID [2020-07-29 01:01:06,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {5185#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,010 INFO L280 TraceCheckUtils]: 10: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,011 INFO L280 TraceCheckUtils]: 11: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,012 INFO L280 TraceCheckUtils]: 12: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,013 INFO L280 TraceCheckUtils]: 13: Hoare triple {5261#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:06,019 INFO L280 TraceCheckUtils]: 14: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:06,020 INFO L280 TraceCheckUtils]: 15: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:06,020 INFO L280 TraceCheckUtils]: 16: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:06,021 INFO L280 TraceCheckUtils]: 17: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:06,022 INFO L280 TraceCheckUtils]: 18: Hoare triple {5262#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:06,023 INFO L280 TraceCheckUtils]: 19: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:06,024 INFO L280 TraceCheckUtils]: 20: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:06,025 INFO L280 TraceCheckUtils]: 21: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:06,025 INFO L280 TraceCheckUtils]: 22: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:06,026 INFO L280 TraceCheckUtils]: 23: Hoare triple {5263#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:06,027 INFO L280 TraceCheckUtils]: 24: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:06,028 INFO L280 TraceCheckUtils]: 25: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:06,029 INFO L280 TraceCheckUtils]: 26: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:06,030 INFO L280 TraceCheckUtils]: 27: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:06,030 INFO L280 TraceCheckUtils]: 28: Hoare triple {5264#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,031 INFO L280 TraceCheckUtils]: 29: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,032 INFO L280 TraceCheckUtils]: 30: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,033 INFO L280 TraceCheckUtils]: 31: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,034 INFO L280 TraceCheckUtils]: 32: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:06,035 INFO L280 TraceCheckUtils]: 33: Hoare triple {5265#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:06,035 INFO L280 TraceCheckUtils]: 34: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !!(~i~0 < ~size); {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:06,036 INFO L280 TraceCheckUtils]: 35: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume 0 <= ~i~0 && ~i~0 < 32; {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:06,037 INFO L280 TraceCheckUtils]: 36: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:06,038 INFO L280 TraceCheckUtils]: 37: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:06,039 INFO L280 TraceCheckUtils]: 38: Hoare triple {5266#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5267#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:06,040 INFO L280 TraceCheckUtils]: 39: Hoare triple {5267#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume !(~i~0 < ~size); {5268#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:06,040 INFO L280 TraceCheckUtils]: 40: Hoare triple {5268#(not (= 32 |foo_#in~size|))} #res := ~i~0; {5268#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:06,041 INFO L280 TraceCheckUtils]: 41: Hoare triple {5268#(not (= 32 |foo_#in~size|))} assume true; {5268#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:06,042 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {5268#(not (= 32 |foo_#in~size|))} {5185#true} #78#return; {5186#false} is VALID [2020-07-29 01:01:06,042 INFO L280 TraceCheckUtils]: 43: Hoare triple {5186#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5186#false} is VALID [2020-07-29 01:01:06,042 INFO L280 TraceCheckUtils]: 44: Hoare triple {5186#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5186#false} is VALID [2020-07-29 01:01:06,043 INFO L280 TraceCheckUtils]: 45: Hoare triple {5186#false} havoc #t~ret3; {5186#false} is VALID [2020-07-29 01:01:06,043 INFO L280 TraceCheckUtils]: 46: Hoare triple {5186#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5186#false} is VALID [2020-07-29 01:01:06,043 INFO L280 TraceCheckUtils]: 47: Hoare triple {5186#false} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5186#false} is VALID [2020-07-29 01:01:06,043 INFO L263 TraceCheckUtils]: 48: Hoare triple {5186#false} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5185#true} is VALID [2020-07-29 01:01:06,043 INFO L280 TraceCheckUtils]: 49: Hoare triple {5185#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5185#true} is VALID [2020-07-29 01:01:06,043 INFO L280 TraceCheckUtils]: 50: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,044 INFO L280 TraceCheckUtils]: 51: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,044 INFO L280 TraceCheckUtils]: 52: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,044 INFO L280 TraceCheckUtils]: 53: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,044 INFO L280 TraceCheckUtils]: 54: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,045 INFO L280 TraceCheckUtils]: 55: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,045 INFO L280 TraceCheckUtils]: 56: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,045 INFO L280 TraceCheckUtils]: 57: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,045 INFO L280 TraceCheckUtils]: 58: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,045 INFO L280 TraceCheckUtils]: 59: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,046 INFO L280 TraceCheckUtils]: 60: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,046 INFO L280 TraceCheckUtils]: 61: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,046 INFO L280 TraceCheckUtils]: 62: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,046 INFO L280 TraceCheckUtils]: 63: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,046 INFO L280 TraceCheckUtils]: 64: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,046 INFO L280 TraceCheckUtils]: 65: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,047 INFO L280 TraceCheckUtils]: 66: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,047 INFO L280 TraceCheckUtils]: 67: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,047 INFO L280 TraceCheckUtils]: 68: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,048 INFO L280 TraceCheckUtils]: 69: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,048 INFO L280 TraceCheckUtils]: 70: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,048 INFO L280 TraceCheckUtils]: 71: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,048 INFO L280 TraceCheckUtils]: 72: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,048 INFO L280 TraceCheckUtils]: 73: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,049 INFO L280 TraceCheckUtils]: 74: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,049 INFO L280 TraceCheckUtils]: 75: Hoare triple {5185#true} assume !!(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,049 INFO L280 TraceCheckUtils]: 76: Hoare triple {5185#true} assume 0 <= ~i~0 && ~i~0 < 32; {5185#true} is VALID [2020-07-29 01:01:06,049 INFO L280 TraceCheckUtils]: 77: Hoare triple {5185#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5185#true} is VALID [2020-07-29 01:01:06,050 INFO L280 TraceCheckUtils]: 78: Hoare triple {5185#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5185#true} is VALID [2020-07-29 01:01:06,050 INFO L280 TraceCheckUtils]: 79: Hoare triple {5185#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5185#true} is VALID [2020-07-29 01:01:06,050 INFO L280 TraceCheckUtils]: 80: Hoare triple {5185#true} assume !(~i~0 < ~size); {5185#true} is VALID [2020-07-29 01:01:06,050 INFO L280 TraceCheckUtils]: 81: Hoare triple {5185#true} #res := ~i~0; {5185#true} is VALID [2020-07-29 01:01:06,050 INFO L280 TraceCheckUtils]: 82: Hoare triple {5185#true} assume true; {5185#true} is VALID [2020-07-29 01:01:06,051 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {5185#true} {5186#false} #78#return; {5186#false} is VALID [2020-07-29 01:01:06,051 INFO L280 TraceCheckUtils]: 84: Hoare triple {5186#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5186#false} is VALID [2020-07-29 01:01:06,051 INFO L280 TraceCheckUtils]: 85: Hoare triple {5186#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {5186#false} is VALID [2020-07-29 01:01:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 2 proven. 277 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-29 01:01:06,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512293886] [2020-07-29 01:01:06,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451322092] [2020-07-29 01:01:06,065 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 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:01:06,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:01:06,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:01:06,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:01:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:06,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:06,590 INFO L263 TraceCheckUtils]: 0: Hoare triple {5185#true} call ULTIMATE.init(); {5185#true} is VALID [2020-07-29 01:01:06,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {5185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5185#true} is VALID [2020-07-29 01:01:06,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {5185#true} assume true; {5185#true} is VALID [2020-07-29 01:01:06,590 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5185#true} {5185#true} #74#return; {5185#true} is VALID [2020-07-29 01:01:06,590 INFO L263 TraceCheckUtils]: 4: Hoare triple {5185#true} call #t~ret6 := main(); {5185#true} is VALID [2020-07-29 01:01:06,591 INFO L280 TraceCheckUtils]: 5: Hoare triple {5185#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {5185#true} is VALID [2020-07-29 01:01:06,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {5185#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5185#true} is VALID [2020-07-29 01:01:06,591 INFO L263 TraceCheckUtils]: 7: Hoare triple {5185#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5185#true} is VALID [2020-07-29 01:01:06,592 INFO L280 TraceCheckUtils]: 8: Hoare triple {5185#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,593 INFO L280 TraceCheckUtils]: 9: Hoare triple {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,593 INFO L280 TraceCheckUtils]: 10: Hoare triple {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,594 INFO L280 TraceCheckUtils]: 11: Hoare triple {5296#(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 {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,595 INFO L280 TraceCheckUtils]: 13: Hoare triple {5296#(and (<= foo_~i~0 0) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:06,596 INFO L280 TraceCheckUtils]: 14: Hoare triple {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume !!(~i~0 < ~size); {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:06,596 INFO L280 TraceCheckUtils]: 15: Hoare triple {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} assume 0 <= ~i~0 && ~i~0 < 32; {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:06,597 INFO L280 TraceCheckUtils]: 16: Hoare triple {5312#(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 {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:06,597 INFO L280 TraceCheckUtils]: 17: Hoare triple {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} is VALID [2020-07-29 01:01:06,598 INFO L280 TraceCheckUtils]: 18: Hoare triple {5312#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:06,598 INFO L280 TraceCheckUtils]: 19: Hoare triple {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume !!(~i~0 < ~size); {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:06,599 INFO L280 TraceCheckUtils]: 20: Hoare triple {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} assume 0 <= ~i~0 && ~i~0 < 32; {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:06,600 INFO L280 TraceCheckUtils]: 21: Hoare triple {5328#(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 {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:06,600 INFO L280 TraceCheckUtils]: 22: Hoare triple {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} is VALID [2020-07-29 01:01:06,601 INFO L280 TraceCheckUtils]: 23: Hoare triple {5328#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:06,601 INFO L280 TraceCheckUtils]: 24: Hoare triple {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume !!(~i~0 < ~size); {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:06,602 INFO L280 TraceCheckUtils]: 25: Hoare triple {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} assume 0 <= ~i~0 && ~i~0 < 32; {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:06,602 INFO L280 TraceCheckUtils]: 26: Hoare triple {5344#(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 {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:06,603 INFO L280 TraceCheckUtils]: 27: Hoare triple {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} is VALID [2020-07-29 01:01:06,603 INFO L280 TraceCheckUtils]: 28: Hoare triple {5344#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,604 INFO L280 TraceCheckUtils]: 29: Hoare triple {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} assume !!(~i~0 < ~size); {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,604 INFO L280 TraceCheckUtils]: 30: Hoare triple {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} assume 0 <= ~i~0 && ~i~0 < 32; {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,605 INFO L280 TraceCheckUtils]: 31: Hoare triple {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,605 INFO L280 TraceCheckUtils]: 32: Hoare triple {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} is VALID [2020-07-29 01:01:06,606 INFO L280 TraceCheckUtils]: 33: Hoare triple {5360#(and (<= foo_~i~0 4) (<= |foo_#in~size| foo_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} is VALID [2020-07-29 01:01:06,606 INFO L280 TraceCheckUtils]: 34: Hoare triple {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} assume !!(~i~0 < ~size); {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} is VALID [2020-07-29 01:01:06,607 INFO L280 TraceCheckUtils]: 35: Hoare triple {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} assume 0 <= ~i~0 && ~i~0 < 32; {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} is VALID [2020-07-29 01:01:06,607 INFO L280 TraceCheckUtils]: 36: Hoare triple {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} is VALID [2020-07-29 01:01:06,608 INFO L280 TraceCheckUtils]: 37: Hoare triple {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} is VALID [2020-07-29 01:01:06,609 INFO L280 TraceCheckUtils]: 38: Hoare triple {5376#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 5))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5392#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 6))} is VALID [2020-07-29 01:01:06,609 INFO L280 TraceCheckUtils]: 39: Hoare triple {5392#(and (<= |foo_#in~size| foo_~size) (<= foo_~i~0 6))} assume !(~i~0 < ~size); {5396#(<= |foo_#in~size| 6)} is VALID [2020-07-29 01:01:06,610 INFO L280 TraceCheckUtils]: 40: Hoare triple {5396#(<= |foo_#in~size| 6)} #res := ~i~0; {5396#(<= |foo_#in~size| 6)} is VALID [2020-07-29 01:01:06,610 INFO L280 TraceCheckUtils]: 41: Hoare triple {5396#(<= |foo_#in~size| 6)} assume true; {5396#(<= |foo_#in~size| 6)} is VALID [2020-07-29 01:01:06,611 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {5396#(<= |foo_#in~size| 6)} {5185#true} #78#return; {5186#false} is VALID [2020-07-29 01:01:06,611 INFO L280 TraceCheckUtils]: 43: Hoare triple {5186#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5186#false} is VALID [2020-07-29 01:01:06,611 INFO L280 TraceCheckUtils]: 44: Hoare triple {5186#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5186#false} is VALID [2020-07-29 01:01:06,611 INFO L280 TraceCheckUtils]: 45: Hoare triple {5186#false} havoc #t~ret3; {5186#false} is VALID [2020-07-29 01:01:06,611 INFO L280 TraceCheckUtils]: 46: Hoare triple {5186#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5186#false} is VALID [2020-07-29 01:01:06,611 INFO L280 TraceCheckUtils]: 47: Hoare triple {5186#false} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5186#false} is VALID [2020-07-29 01:01:06,612 INFO L263 TraceCheckUtils]: 48: Hoare triple {5186#false} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5186#false} is VALID [2020-07-29 01:01:06,612 INFO L280 TraceCheckUtils]: 49: Hoare triple {5186#false} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5186#false} is VALID [2020-07-29 01:01:06,612 INFO L280 TraceCheckUtils]: 50: Hoare triple {5186#false} assume !!(~i~0 < ~size); {5186#false} is VALID [2020-07-29 01:01:06,612 INFO L280 TraceCheckUtils]: 51: Hoare triple {5186#false} assume 0 <= ~i~0 && ~i~0 < 32; {5186#false} is VALID [2020-07-29 01:01:06,612 INFO L280 TraceCheckUtils]: 52: Hoare triple {5186#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5186#false} is VALID [2020-07-29 01:01:06,612 INFO L280 TraceCheckUtils]: 53: Hoare triple {5186#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5186#false} is VALID [2020-07-29 01:01:06,612 INFO L280 TraceCheckUtils]: 54: Hoare triple {5186#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5186#false} is VALID [2020-07-29 01:01:06,613 INFO L280 TraceCheckUtils]: 55: Hoare triple {5186#false} assume !!(~i~0 < ~size); {5186#false} is VALID [2020-07-29 01:01:06,613 INFO L280 TraceCheckUtils]: 56: Hoare triple {5186#false} assume 0 <= ~i~0 && ~i~0 < 32; {5186#false} is VALID [2020-07-29 01:01:06,613 INFO L280 TraceCheckUtils]: 57: Hoare triple {5186#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5186#false} is VALID [2020-07-29 01:01:06,613 INFO L280 TraceCheckUtils]: 58: Hoare triple {5186#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5186#false} is VALID [2020-07-29 01:01:06,613 INFO L280 TraceCheckUtils]: 59: Hoare triple {5186#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5186#false} is VALID [2020-07-29 01:01:06,613 INFO L280 TraceCheckUtils]: 60: Hoare triple {5186#false} assume !!(~i~0 < ~size); {5186#false} is VALID [2020-07-29 01:01:06,613 INFO L280 TraceCheckUtils]: 61: Hoare triple {5186#false} assume 0 <= ~i~0 && ~i~0 < 32; {5186#false} is VALID [2020-07-29 01:01:06,614 INFO L280 TraceCheckUtils]: 62: Hoare triple {5186#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5186#false} is VALID [2020-07-29 01:01:06,614 INFO L280 TraceCheckUtils]: 63: Hoare triple {5186#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5186#false} is VALID [2020-07-29 01:01:06,614 INFO L280 TraceCheckUtils]: 64: Hoare triple {5186#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5186#false} is VALID [2020-07-29 01:01:06,614 INFO L280 TraceCheckUtils]: 65: Hoare triple {5186#false} assume !!(~i~0 < ~size); {5186#false} is VALID [2020-07-29 01:01:06,614 INFO L280 TraceCheckUtils]: 66: Hoare triple {5186#false} assume 0 <= ~i~0 && ~i~0 < 32; {5186#false} is VALID [2020-07-29 01:01:06,614 INFO L280 TraceCheckUtils]: 67: Hoare triple {5186#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5186#false} is VALID [2020-07-29 01:01:06,614 INFO L280 TraceCheckUtils]: 68: Hoare triple {5186#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5186#false} is VALID [2020-07-29 01:01:06,615 INFO L280 TraceCheckUtils]: 69: Hoare triple {5186#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5186#false} is VALID [2020-07-29 01:01:06,615 INFO L280 TraceCheckUtils]: 70: Hoare triple {5186#false} assume !!(~i~0 < ~size); {5186#false} is VALID [2020-07-29 01:01:06,615 INFO L280 TraceCheckUtils]: 71: Hoare triple {5186#false} assume 0 <= ~i~0 && ~i~0 < 32; {5186#false} is VALID [2020-07-29 01:01:06,615 INFO L280 TraceCheckUtils]: 72: Hoare triple {5186#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5186#false} is VALID [2020-07-29 01:01:06,615 INFO L280 TraceCheckUtils]: 73: Hoare triple {5186#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5186#false} is VALID [2020-07-29 01:01:06,615 INFO L280 TraceCheckUtils]: 74: Hoare triple {5186#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5186#false} is VALID [2020-07-29 01:01:06,616 INFO L280 TraceCheckUtils]: 75: Hoare triple {5186#false} assume !!(~i~0 < ~size); {5186#false} is VALID [2020-07-29 01:01:06,616 INFO L280 TraceCheckUtils]: 76: Hoare triple {5186#false} assume 0 <= ~i~0 && ~i~0 < 32; {5186#false} is VALID [2020-07-29 01:01:06,616 INFO L280 TraceCheckUtils]: 77: Hoare triple {5186#false} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5186#false} is VALID [2020-07-29 01:01:06,616 INFO L280 TraceCheckUtils]: 78: Hoare triple {5186#false} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5186#false} is VALID [2020-07-29 01:01:06,617 INFO L280 TraceCheckUtils]: 79: Hoare triple {5186#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5186#false} is VALID [2020-07-29 01:01:06,617 INFO L280 TraceCheckUtils]: 80: Hoare triple {5186#false} assume !(~i~0 < ~size); {5186#false} is VALID [2020-07-29 01:01:06,617 INFO L280 TraceCheckUtils]: 81: Hoare triple {5186#false} #res := ~i~0; {5186#false} is VALID [2020-07-29 01:01:06,617 INFO L280 TraceCheckUtils]: 82: Hoare triple {5186#false} assume true; {5186#false} is VALID [2020-07-29 01:01:06,617 INFO L275 TraceCheckUtils]: 83: Hoare quadruple {5186#false} {5186#false} #78#return; {5186#false} is VALID [2020-07-29 01:01:06,617 INFO L280 TraceCheckUtils]: 84: Hoare triple {5186#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5186#false} is VALID [2020-07-29 01:01:06,618 INFO L280 TraceCheckUtils]: 85: Hoare triple {5186#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {5186#false} is VALID [2020-07-29 01:01:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 199 proven. 81 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2020-07-29 01:01:06,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:01:06,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-07-29 01:01:06,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653176993] [2020-07-29 01:01:06,627 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2020-07-29 01:01:06,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:06,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-29 01:01:06,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:06,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-29 01:01:06,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-29 01:01:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2020-07-29 01:01:06,757 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 19 states. [2020-07-29 01:01:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:07,960 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2020-07-29 01:01:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:01:07,960 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2020-07-29 01:01:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:01:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2020-07-29 01:01:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:01:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2020-07-29 01:01:07,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2020-07-29 01:01:08,076 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:01:08,078 INFO L225 Difference]: With dead ends: 82 [2020-07-29 01:01:08,078 INFO L226 Difference]: Without dead ends: 79 [2020-07-29 01:01:08,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2020-07-29 01:01:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-29 01:01:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2020-07-29 01:01:08,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:08,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 75 states. [2020-07-29 01:01:08,081 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 75 states. [2020-07-29 01:01:08,081 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 75 states. [2020-07-29 01:01:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:08,085 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2020-07-29 01:01:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-07-29 01:01:08,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:08,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:08,086 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 79 states. [2020-07-29 01:01:08,086 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 79 states. [2020-07-29 01:01:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:08,088 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2020-07-29 01:01:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-07-29 01:01:08,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:08,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:08,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:08,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-29 01:01:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-07-29 01:01:08,091 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 86 [2020-07-29 01:01:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:08,091 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-07-29 01:01:08,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-29 01:01:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-29 01:01:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-29 01:01:08,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:08,092 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:08,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-07-29 01:01:08,307 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:01:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1055273099, now seen corresponding path program 3 times [2020-07-29 01:01:08,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:08,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473802762] [2020-07-29 01:01:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:08,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:08,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {5950#(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; {5865#true} is VALID [2020-07-29 01:01:08,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {5865#true} assume true; {5865#true} is VALID [2020-07-29 01:01:08,384 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5865#true} {5865#true} #74#return; {5865#true} is VALID [2020-07-29 01:01:08,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:08,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {5865#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,779 INFO L280 TraceCheckUtils]: 3: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,782 INFO L280 TraceCheckUtils]: 6: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,783 INFO L280 TraceCheckUtils]: 7: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,785 INFO L280 TraceCheckUtils]: 10: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,786 INFO L280 TraceCheckUtils]: 11: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,787 INFO L280 TraceCheckUtils]: 12: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,787 INFO L280 TraceCheckUtils]: 13: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,788 INFO L280 TraceCheckUtils]: 14: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,789 INFO L280 TraceCheckUtils]: 15: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,789 INFO L280 TraceCheckUtils]: 16: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,790 INFO L280 TraceCheckUtils]: 17: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,791 INFO L280 TraceCheckUtils]: 18: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,791 INFO L280 TraceCheckUtils]: 19: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,792 INFO L280 TraceCheckUtils]: 20: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,793 INFO L280 TraceCheckUtils]: 21: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,793 INFO L280 TraceCheckUtils]: 22: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,794 INFO L280 TraceCheckUtils]: 23: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,795 INFO L280 TraceCheckUtils]: 24: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,795 INFO L280 TraceCheckUtils]: 25: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,796 INFO L280 TraceCheckUtils]: 26: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !!(~i~0 < ~size); {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,797 INFO L280 TraceCheckUtils]: 27: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume 0 <= ~i~0 && ~i~0 < 32; {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,797 INFO L280 TraceCheckUtils]: 28: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,798 INFO L280 TraceCheckUtils]: 29: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,799 INFO L280 TraceCheckUtils]: 30: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,800 INFO L280 TraceCheckUtils]: 31: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume !!(~i~0 < ~size); {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,801 INFO L280 TraceCheckUtils]: 32: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume 0 <= ~i~0 && ~i~0 < 32; {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,802 INFO L280 TraceCheckUtils]: 33: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,803 INFO L280 TraceCheckUtils]: 34: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,804 INFO L280 TraceCheckUtils]: 35: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5958#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,804 INFO L280 TraceCheckUtils]: 36: Hoare triple {5958#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} assume !(~i~0 < ~size); {5959#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:08,805 INFO L280 TraceCheckUtils]: 37: Hoare triple {5959#(not (= 32 |foo_#in~size|))} #res := ~i~0; {5959#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:08,805 INFO L280 TraceCheckUtils]: 38: Hoare triple {5959#(not (= 32 |foo_#in~size|))} assume true; {5959#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:08,806 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5959#(not (= 32 |foo_#in~size|))} {5865#true} #78#return; {5866#false} is VALID [2020-07-29 01:01:08,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-07-29 01:01:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:08,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {5865#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5865#true} is VALID [2020-07-29 01:01:08,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,831 INFO L280 TraceCheckUtils]: 2: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,831 INFO L280 TraceCheckUtils]: 3: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,832 INFO L280 TraceCheckUtils]: 5: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,832 INFO L280 TraceCheckUtils]: 7: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,832 INFO L280 TraceCheckUtils]: 8: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,833 INFO L280 TraceCheckUtils]: 9: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,833 INFO L280 TraceCheckUtils]: 10: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,834 INFO L280 TraceCheckUtils]: 13: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,834 INFO L280 TraceCheckUtils]: 14: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,834 INFO L280 TraceCheckUtils]: 15: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,834 INFO L280 TraceCheckUtils]: 16: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,834 INFO L280 TraceCheckUtils]: 17: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,835 INFO L280 TraceCheckUtils]: 18: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,835 INFO L280 TraceCheckUtils]: 19: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,835 INFO L280 TraceCheckUtils]: 20: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,835 INFO L280 TraceCheckUtils]: 21: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,836 INFO L280 TraceCheckUtils]: 22: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,836 INFO L280 TraceCheckUtils]: 23: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,836 INFO L280 TraceCheckUtils]: 24: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,836 INFO L280 TraceCheckUtils]: 25: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,837 INFO L280 TraceCheckUtils]: 26: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,837 INFO L280 TraceCheckUtils]: 27: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,837 INFO L280 TraceCheckUtils]: 28: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,837 INFO L280 TraceCheckUtils]: 29: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,837 INFO L280 TraceCheckUtils]: 30: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,838 INFO L280 TraceCheckUtils]: 31: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,838 INFO L280 TraceCheckUtils]: 32: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,838 INFO L280 TraceCheckUtils]: 33: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,838 INFO L280 TraceCheckUtils]: 34: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,839 INFO L280 TraceCheckUtils]: 35: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,839 INFO L280 TraceCheckUtils]: 36: Hoare triple {5865#true} assume !(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,839 INFO L280 TraceCheckUtils]: 37: Hoare triple {5865#true} #res := ~i~0; {5865#true} is VALID [2020-07-29 01:01:08,839 INFO L280 TraceCheckUtils]: 38: Hoare triple {5865#true} assume true; {5865#true} is VALID [2020-07-29 01:01:08,840 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {5865#true} {5866#false} #78#return; {5866#false} is VALID [2020-07-29 01:01:08,844 INFO L263 TraceCheckUtils]: 0: Hoare triple {5865#true} call ULTIMATE.init(); {5950#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:08,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {5950#(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; {5865#true} is VALID [2020-07-29 01:01:08,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {5865#true} assume true; {5865#true} is VALID [2020-07-29 01:01:08,845 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5865#true} {5865#true} #74#return; {5865#true} is VALID [2020-07-29 01:01:08,845 INFO L263 TraceCheckUtils]: 4: Hoare triple {5865#true} call #t~ret6 := main(); {5865#true} is VALID [2020-07-29 01:01:08,845 INFO L280 TraceCheckUtils]: 5: Hoare triple {5865#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {5865#true} is VALID [2020-07-29 01:01:08,846 INFO L280 TraceCheckUtils]: 6: Hoare triple {5865#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5865#true} is VALID [2020-07-29 01:01:08,846 INFO L263 TraceCheckUtils]: 7: Hoare triple {5865#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5865#true} is VALID [2020-07-29 01:01:08,847 INFO L280 TraceCheckUtils]: 8: Hoare triple {5865#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,848 INFO L280 TraceCheckUtils]: 10: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,850 INFO L280 TraceCheckUtils]: 12: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,851 INFO L280 TraceCheckUtils]: 13: Hoare triple {5951#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,852 INFO L280 TraceCheckUtils]: 14: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,852 INFO L280 TraceCheckUtils]: 15: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,853 INFO L280 TraceCheckUtils]: 16: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,854 INFO L280 TraceCheckUtils]: 17: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:08,855 INFO L280 TraceCheckUtils]: 18: Hoare triple {5952#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,856 INFO L280 TraceCheckUtils]: 19: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,856 INFO L280 TraceCheckUtils]: 20: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,857 INFO L280 TraceCheckUtils]: 21: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,858 INFO L280 TraceCheckUtils]: 22: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:08,859 INFO L280 TraceCheckUtils]: 23: Hoare triple {5953#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,860 INFO L280 TraceCheckUtils]: 24: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,860 INFO L280 TraceCheckUtils]: 25: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,861 INFO L280 TraceCheckUtils]: 26: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,862 INFO L280 TraceCheckUtils]: 27: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:08,863 INFO L280 TraceCheckUtils]: 28: Hoare triple {5954#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,864 INFO L280 TraceCheckUtils]: 29: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,864 INFO L280 TraceCheckUtils]: 30: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,865 INFO L280 TraceCheckUtils]: 31: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,866 INFO L280 TraceCheckUtils]: 32: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,867 INFO L280 TraceCheckUtils]: 33: Hoare triple {5955#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,868 INFO L280 TraceCheckUtils]: 34: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !!(~i~0 < ~size); {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,869 INFO L280 TraceCheckUtils]: 35: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume 0 <= ~i~0 && ~i~0 < 32; {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,869 INFO L280 TraceCheckUtils]: 36: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,870 INFO L280 TraceCheckUtils]: 37: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:08,871 INFO L280 TraceCheckUtils]: 38: Hoare triple {5956#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,872 INFO L280 TraceCheckUtils]: 39: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume !!(~i~0 < ~size); {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,873 INFO L280 TraceCheckUtils]: 40: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume 0 <= ~i~0 && ~i~0 < 32; {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,873 INFO L280 TraceCheckUtils]: 41: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,874 INFO L280 TraceCheckUtils]: 42: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:08,875 INFO L280 TraceCheckUtils]: 43: Hoare triple {5957#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5958#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:08,876 INFO L280 TraceCheckUtils]: 44: Hoare triple {5958#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} assume !(~i~0 < ~size); {5959#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:08,877 INFO L280 TraceCheckUtils]: 45: Hoare triple {5959#(not (= 32 |foo_#in~size|))} #res := ~i~0; {5959#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:08,877 INFO L280 TraceCheckUtils]: 46: Hoare triple {5959#(not (= 32 |foo_#in~size|))} assume true; {5959#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:08,878 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {5959#(not (= 32 |foo_#in~size|))} {5865#true} #78#return; {5866#false} is VALID [2020-07-29 01:01:08,878 INFO L280 TraceCheckUtils]: 48: Hoare triple {5866#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5866#false} is VALID [2020-07-29 01:01:08,878 INFO L280 TraceCheckUtils]: 49: Hoare triple {5866#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5866#false} is VALID [2020-07-29 01:01:08,879 INFO L280 TraceCheckUtils]: 50: Hoare triple {5866#false} havoc #t~ret3; {5866#false} is VALID [2020-07-29 01:01:08,879 INFO L280 TraceCheckUtils]: 51: Hoare triple {5866#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {5866#false} is VALID [2020-07-29 01:01:08,879 INFO L280 TraceCheckUtils]: 52: Hoare triple {5866#false} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5866#false} is VALID [2020-07-29 01:01:08,879 INFO L263 TraceCheckUtils]: 53: Hoare triple {5866#false} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5865#true} is VALID [2020-07-29 01:01:08,879 INFO L280 TraceCheckUtils]: 54: Hoare triple {5865#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5865#true} is VALID [2020-07-29 01:01:08,880 INFO L280 TraceCheckUtils]: 55: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,880 INFO L280 TraceCheckUtils]: 56: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,880 INFO L280 TraceCheckUtils]: 57: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,880 INFO L280 TraceCheckUtils]: 58: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,881 INFO L280 TraceCheckUtils]: 59: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,881 INFO L280 TraceCheckUtils]: 60: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,881 INFO L280 TraceCheckUtils]: 61: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,881 INFO L280 TraceCheckUtils]: 62: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,881 INFO L280 TraceCheckUtils]: 63: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,882 INFO L280 TraceCheckUtils]: 64: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,882 INFO L280 TraceCheckUtils]: 65: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,882 INFO L280 TraceCheckUtils]: 66: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,882 INFO L280 TraceCheckUtils]: 67: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,883 INFO L280 TraceCheckUtils]: 68: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,883 INFO L280 TraceCheckUtils]: 69: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,883 INFO L280 TraceCheckUtils]: 70: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,883 INFO L280 TraceCheckUtils]: 71: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,883 INFO L280 TraceCheckUtils]: 72: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,884 INFO L280 TraceCheckUtils]: 73: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,884 INFO L280 TraceCheckUtils]: 74: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,884 INFO L280 TraceCheckUtils]: 75: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,884 INFO L280 TraceCheckUtils]: 76: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,885 INFO L280 TraceCheckUtils]: 77: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,885 INFO L280 TraceCheckUtils]: 78: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,885 INFO L280 TraceCheckUtils]: 79: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,885 INFO L280 TraceCheckUtils]: 80: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,885 INFO L280 TraceCheckUtils]: 81: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,886 INFO L280 TraceCheckUtils]: 82: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,886 INFO L280 TraceCheckUtils]: 83: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,886 INFO L280 TraceCheckUtils]: 84: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,886 INFO L280 TraceCheckUtils]: 85: Hoare triple {5865#true} assume !!(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,886 INFO L280 TraceCheckUtils]: 86: Hoare triple {5865#true} assume 0 <= ~i~0 && ~i~0 < 32; {5865#true} is VALID [2020-07-29 01:01:08,887 INFO L280 TraceCheckUtils]: 87: Hoare triple {5865#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5865#true} is VALID [2020-07-29 01:01:08,887 INFO L280 TraceCheckUtils]: 88: Hoare triple {5865#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5865#true} is VALID [2020-07-29 01:01:08,887 INFO L280 TraceCheckUtils]: 89: Hoare triple {5865#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5865#true} is VALID [2020-07-29 01:01:08,887 INFO L280 TraceCheckUtils]: 90: Hoare triple {5865#true} assume !(~i~0 < ~size); {5865#true} is VALID [2020-07-29 01:01:08,888 INFO L280 TraceCheckUtils]: 91: Hoare triple {5865#true} #res := ~i~0; {5865#true} is VALID [2020-07-29 01:01:08,888 INFO L280 TraceCheckUtils]: 92: Hoare triple {5865#true} assume true; {5865#true} is VALID [2020-07-29 01:01:08,888 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {5865#true} {5866#false} #78#return; {5866#false} is VALID [2020-07-29 01:01:08,888 INFO L280 TraceCheckUtils]: 94: Hoare triple {5866#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5866#false} is VALID [2020-07-29 01:01:08,888 INFO L280 TraceCheckUtils]: 95: Hoare triple {5866#false} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {5866#false} is VALID [2020-07-29 01:01:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 2 proven. 375 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-07-29 01:01:08,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473802762] [2020-07-29 01:01:08,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845717607] [2020-07-29 01:01:08,923 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 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:01:08,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-29 01:01:08,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:01:08,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:01:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:09,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:09,026 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_16|], 1=[|v_#valid_27|]} [2020-07-29 01:01:09,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:01:09,031 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:01:09,031 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:09,041 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:09,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:01:09,047 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:01:09,051 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:09,059 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:09,060 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:01:09,060 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2020-07-29 01:01:09,063 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:09,064 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_16|, |main_~#mask~0.base|, |v_#valid_27|]. (and (<= (select (store |v_#valid_27| |main_~#b~0.base| 1) |main_~#mask~0.base|) 0) (= 0 |main_~#b~0.offset|) (= (store (store |v_#length_16| |main_~#b~0.base| 400) |main_~#mask~0.base| 32) |#length|) (<= 0 main_~i~1)) [2020-07-29 01:01:09,064 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#mask~0.base|]. (and (= 32 (select |#length| |main_~#mask~0.base|)) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1)) [2020-07-29 01:01:10,117 INFO L263 TraceCheckUtils]: 0: Hoare triple {5865#true} call ULTIMATE.init(); {5865#true} is VALID [2020-07-29 01:01:10,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {5865#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {5865#true} is VALID [2020-07-29 01:01:10,118 INFO L280 TraceCheckUtils]: 2: Hoare triple {5865#true} assume true; {5865#true} is VALID [2020-07-29 01:01:10,118 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5865#true} {5865#true} #74#return; {5865#true} is VALID [2020-07-29 01:01:10,118 INFO L263 TraceCheckUtils]: 4: Hoare triple {5865#true} call #t~ret6 := main(); {5865#true} is VALID [2020-07-29 01:01:10,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {5865#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} is VALID [2020-07-29 01:01:10,121 INFO L280 TraceCheckUtils]: 6: Hoare triple {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} is VALID [2020-07-29 01:01:10,122 INFO L263 TraceCheckUtils]: 7: Hoare triple {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,122 INFO L280 TraceCheckUtils]: 8: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,124 INFO L280 TraceCheckUtils]: 10: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,124 INFO L280 TraceCheckUtils]: 11: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,125 INFO L280 TraceCheckUtils]: 12: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,126 INFO L280 TraceCheckUtils]: 13: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,127 INFO L280 TraceCheckUtils]: 14: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,127 INFO L280 TraceCheckUtils]: 15: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,128 INFO L280 TraceCheckUtils]: 16: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,128 INFO L280 TraceCheckUtils]: 17: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,129 INFO L280 TraceCheckUtils]: 18: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,129 INFO L280 TraceCheckUtils]: 19: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,130 INFO L280 TraceCheckUtils]: 20: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,137 INFO L280 TraceCheckUtils]: 21: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,138 INFO L280 TraceCheckUtils]: 22: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,139 INFO L280 TraceCheckUtils]: 23: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,139 INFO L280 TraceCheckUtils]: 24: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,140 INFO L280 TraceCheckUtils]: 25: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,140 INFO L280 TraceCheckUtils]: 26: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,141 INFO L280 TraceCheckUtils]: 27: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,142 INFO L280 TraceCheckUtils]: 28: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,142 INFO L280 TraceCheckUtils]: 29: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,143 INFO L280 TraceCheckUtils]: 30: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,143 INFO L280 TraceCheckUtils]: 31: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,144 INFO L280 TraceCheckUtils]: 33: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,145 INFO L280 TraceCheckUtils]: 34: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,145 INFO L280 TraceCheckUtils]: 35: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,146 INFO L280 TraceCheckUtils]: 36: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,146 INFO L280 TraceCheckUtils]: 37: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,147 INFO L280 TraceCheckUtils]: 38: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,148 INFO L280 TraceCheckUtils]: 39: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,149 INFO L280 TraceCheckUtils]: 40: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,149 INFO L280 TraceCheckUtils]: 41: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,150 INFO L280 TraceCheckUtils]: 42: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,150 INFO L280 TraceCheckUtils]: 43: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,151 INFO L280 TraceCheckUtils]: 44: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,151 INFO L280 TraceCheckUtils]: 45: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #res := ~i~0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,152 INFO L280 TraceCheckUtils]: 46: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume true; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,153 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} #78#return; {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} is VALID [2020-07-29 01:01:10,153 INFO L280 TraceCheckUtils]: 48: Hoare triple {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} is VALID [2020-07-29 01:01:10,154 INFO L280 TraceCheckUtils]: 49: Hoare triple {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} is VALID [2020-07-29 01:01:10,155 INFO L280 TraceCheckUtils]: 50: Hoare triple {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} havoc #t~ret3; {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} is VALID [2020-07-29 01:01:10,155 INFO L280 TraceCheckUtils]: 51: Hoare triple {5978#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (<= 0 main_~i~1))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6118#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} is VALID [2020-07-29 01:01:10,156 INFO L280 TraceCheckUtils]: 52: Hoare triple {6118#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|))} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6122#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (< main_~i~1 32))} is VALID [2020-07-29 01:01:10,157 INFO L263 TraceCheckUtils]: 53: Hoare triple {6122#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (< main_~i~1 32))} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,158 INFO L280 TraceCheckUtils]: 54: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,158 INFO L280 TraceCheckUtils]: 55: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,159 INFO L280 TraceCheckUtils]: 56: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,160 INFO L280 TraceCheckUtils]: 57: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,160 INFO L280 TraceCheckUtils]: 58: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,161 INFO L280 TraceCheckUtils]: 59: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,161 INFO L280 TraceCheckUtils]: 60: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,162 INFO L280 TraceCheckUtils]: 61: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,163 INFO L280 TraceCheckUtils]: 62: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,163 INFO L280 TraceCheckUtils]: 63: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,164 INFO L280 TraceCheckUtils]: 64: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,164 INFO L280 TraceCheckUtils]: 65: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,165 INFO L280 TraceCheckUtils]: 66: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,165 INFO L280 TraceCheckUtils]: 67: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,166 INFO L280 TraceCheckUtils]: 68: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,166 INFO L280 TraceCheckUtils]: 69: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,167 INFO L280 TraceCheckUtils]: 70: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,167 INFO L280 TraceCheckUtils]: 71: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,168 INFO L280 TraceCheckUtils]: 72: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,168 INFO L280 TraceCheckUtils]: 73: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,169 INFO L280 TraceCheckUtils]: 74: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,169 INFO L280 TraceCheckUtils]: 75: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,170 INFO L280 TraceCheckUtils]: 76: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,171 INFO L280 TraceCheckUtils]: 77: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,171 INFO L280 TraceCheckUtils]: 78: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,172 INFO L280 TraceCheckUtils]: 79: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,172 INFO L280 TraceCheckUtils]: 80: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,173 INFO L280 TraceCheckUtils]: 81: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,173 INFO L280 TraceCheckUtils]: 82: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,174 INFO L280 TraceCheckUtils]: 83: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,174 INFO L280 TraceCheckUtils]: 84: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,175 INFO L280 TraceCheckUtils]: 85: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !!(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,175 INFO L280 TraceCheckUtils]: 86: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume 0 <= ~i~0 && ~i~0 < 32; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,176 INFO L280 TraceCheckUtils]: 87: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,183 INFO L280 TraceCheckUtils]: 88: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,184 INFO L280 TraceCheckUtils]: 89: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,185 INFO L280 TraceCheckUtils]: 90: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume !(~i~0 < ~size); {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,186 INFO L280 TraceCheckUtils]: 91: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} #res := ~i~0; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,186 INFO L280 TraceCheckUtils]: 92: Hoare triple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} assume true; {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} is VALID [2020-07-29 01:01:10,187 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {5985#(and (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (exists ((|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (= 400 (select |#length| |v_main_~#b~0.base_BEFORE_CALL_4|))))} {6122#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (< main_~i~1 32))} #78#return; {6122#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (< main_~i~1 32))} is VALID [2020-07-29 01:01:10,188 INFO L280 TraceCheckUtils]: 94: Hoare triple {6122#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (< main_~i~1 32))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6122#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (< main_~i~1 32))} is VALID [2020-07-29 01:01:10,189 INFO L280 TraceCheckUtils]: 95: Hoare triple {6122#(and (<= 1 main_~i~1) (exists ((|main_~#mask~0.base| Int)) (= 32 (select |#length| |main_~#mask~0.base|))) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|) (< main_~i~1 32))} assume !(4 + (~#b~0.offset + 4 * ~i~1) <= #length[~#b~0.base] && 0 <= ~#b~0.offset + 4 * ~i~1); {5866#false} is VALID [2020-07-29 01:01:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2020-07-29 01:01:10,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:01:10,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2020-07-29 01:01:10,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735568310] [2020-07-29 01:01:10,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2020-07-29 01:01:10,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:10,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:01:10,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:10,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:01:10,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:01:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:01:10,271 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 6 states. [2020-07-29 01:01:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:10,502 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-29 01:01:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:01:10,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2020-07-29 01:01:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:01:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-29 01:01:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:01:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-29 01:01:10,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-29 01:01:10,585 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:01:10,586 INFO L225 Difference]: With dead ends: 74 [2020-07-29 01:01:10,587 INFO L226 Difference]: Without dead ends: 74 [2020-07-29 01:01:10,587 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:01:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-29 01:01:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2020-07-29 01:01:10,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:10,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2020-07-29 01:01:10,590 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2020-07-29 01:01:10,590 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2020-07-29 01:01:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:10,592 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-29 01:01:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-29 01:01:10,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:10,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:10,593 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2020-07-29 01:01:10,593 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2020-07-29 01:01:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:10,595 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2020-07-29 01:01:10,595 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-29 01:01:10,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:10,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:10,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:10,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-29 01:01:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-07-29 01:01:10,598 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 96 [2020-07-29 01:01:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:10,599 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-07-29 01:01:10,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:01:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-07-29 01:01:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-29 01:01:10,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:10,601 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:10,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:10,816 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:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:10,816 INFO L82 PathProgramCache]: Analyzing trace with hash -81231572, now seen corresponding path program 2 times [2020-07-29 01:01:10,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:01:10,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041975839] [2020-07-29 01:01:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:01:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:10,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:01:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:10,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {6631#(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; {6546#true} is VALID [2020-07-29 01:01:10,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {6546#true} assume true; {6546#true} is VALID [2020-07-29 01:01:10,864 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6546#true} {6546#true} #74#return; {6546#true} is VALID [2020-07-29 01:01:10,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:01:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {6546#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,235 INFO L280 TraceCheckUtils]: 3: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,237 INFO L280 TraceCheckUtils]: 5: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,237 INFO L280 TraceCheckUtils]: 6: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,238 INFO L280 TraceCheckUtils]: 7: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,238 INFO L280 TraceCheckUtils]: 8: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,239 INFO L280 TraceCheckUtils]: 9: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,239 INFO L280 TraceCheckUtils]: 10: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,240 INFO L280 TraceCheckUtils]: 11: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,241 INFO L280 TraceCheckUtils]: 13: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,242 INFO L280 TraceCheckUtils]: 14: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,242 INFO L280 TraceCheckUtils]: 15: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,243 INFO L280 TraceCheckUtils]: 16: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,243 INFO L280 TraceCheckUtils]: 17: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,244 INFO L280 TraceCheckUtils]: 18: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,244 INFO L280 TraceCheckUtils]: 19: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,246 INFO L280 TraceCheckUtils]: 21: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,246 INFO L280 TraceCheckUtils]: 22: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,247 INFO L280 TraceCheckUtils]: 23: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,247 INFO L280 TraceCheckUtils]: 24: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,248 INFO L280 TraceCheckUtils]: 25: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,248 INFO L280 TraceCheckUtils]: 26: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !!(~i~0 < ~size); {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,249 INFO L280 TraceCheckUtils]: 27: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume 0 <= ~i~0 && ~i~0 < 32; {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,250 INFO L280 TraceCheckUtils]: 28: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,250 INFO L280 TraceCheckUtils]: 29: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,251 INFO L280 TraceCheckUtils]: 30: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,251 INFO L280 TraceCheckUtils]: 31: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume !!(~i~0 < ~size); {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,252 INFO L280 TraceCheckUtils]: 32: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume 0 <= ~i~0 && ~i~0 < 32; {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,253 INFO L280 TraceCheckUtils]: 33: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,253 INFO L280 TraceCheckUtils]: 34: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,254 INFO L280 TraceCheckUtils]: 35: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,255 INFO L280 TraceCheckUtils]: 36: Hoare triple {6639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} assume !(~i~0 < ~size); {6640#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:11,256 INFO L280 TraceCheckUtils]: 37: Hoare triple {6640#(not (= 32 |foo_#in~size|))} #res := ~i~0; {6640#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:11,257 INFO L280 TraceCheckUtils]: 38: Hoare triple {6640#(not (= 32 |foo_#in~size|))} assume true; {6640#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:11,258 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {6640#(not (= 32 |foo_#in~size|))} {6546#true} #78#return; {6547#false} is VALID [2020-07-29 01:01:11,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-07-29 01:01:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {6546#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6546#true} is VALID [2020-07-29 01:01:11,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,284 INFO L280 TraceCheckUtils]: 6: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,285 INFO L280 TraceCheckUtils]: 7: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,285 INFO L280 TraceCheckUtils]: 11: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,286 INFO L280 TraceCheckUtils]: 12: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,286 INFO L280 TraceCheckUtils]: 13: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,286 INFO L280 TraceCheckUtils]: 15: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,286 INFO L280 TraceCheckUtils]: 16: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,286 INFO L280 TraceCheckUtils]: 17: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,287 INFO L280 TraceCheckUtils]: 18: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,287 INFO L280 TraceCheckUtils]: 19: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,287 INFO L280 TraceCheckUtils]: 20: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,287 INFO L280 TraceCheckUtils]: 21: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,287 INFO L280 TraceCheckUtils]: 22: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,287 INFO L280 TraceCheckUtils]: 23: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,288 INFO L280 TraceCheckUtils]: 24: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,288 INFO L280 TraceCheckUtils]: 25: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,288 INFO L280 TraceCheckUtils]: 26: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,288 INFO L280 TraceCheckUtils]: 27: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,288 INFO L280 TraceCheckUtils]: 28: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,289 INFO L280 TraceCheckUtils]: 29: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,289 INFO L280 TraceCheckUtils]: 30: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,289 INFO L280 TraceCheckUtils]: 31: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,289 INFO L280 TraceCheckUtils]: 32: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,289 INFO L280 TraceCheckUtils]: 33: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,289 INFO L280 TraceCheckUtils]: 34: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,290 INFO L280 TraceCheckUtils]: 35: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,290 INFO L280 TraceCheckUtils]: 36: Hoare triple {6546#true} assume !(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,290 INFO L280 TraceCheckUtils]: 37: Hoare triple {6546#true} #res := ~i~0; {6546#true} is VALID [2020-07-29 01:01:11,290 INFO L280 TraceCheckUtils]: 38: Hoare triple {6546#true} assume true; {6546#true} is VALID [2020-07-29 01:01:11,290 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {6546#true} {6547#false} #78#return; {6547#false} is VALID [2020-07-29 01:01:11,292 INFO L263 TraceCheckUtils]: 0: Hoare triple {6546#true} call ULTIMATE.init(); {6631#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-29 01:01:11,292 INFO L280 TraceCheckUtils]: 1: Hoare triple {6631#(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; {6546#true} is VALID [2020-07-29 01:01:11,292 INFO L280 TraceCheckUtils]: 2: Hoare triple {6546#true} assume true; {6546#true} is VALID [2020-07-29 01:01:11,292 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6546#true} {6546#true} #74#return; {6546#true} is VALID [2020-07-29 01:01:11,293 INFO L263 TraceCheckUtils]: 4: Hoare triple {6546#true} call #t~ret6 := main(); {6546#true} is VALID [2020-07-29 01:01:11,293 INFO L280 TraceCheckUtils]: 5: Hoare triple {6546#true} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {6546#true} is VALID [2020-07-29 01:01:11,293 INFO L280 TraceCheckUtils]: 6: Hoare triple {6546#true} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6546#true} is VALID [2020-07-29 01:01:11,293 INFO L263 TraceCheckUtils]: 7: Hoare triple {6546#true} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {6546#true} is VALID [2020-07-29 01:01:11,294 INFO L280 TraceCheckUtils]: 8: Hoare triple {6546#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,294 INFO L280 TraceCheckUtils]: 9: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,297 INFO L280 TraceCheckUtils]: 12: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,297 INFO L280 TraceCheckUtils]: 13: Hoare triple {6632#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 0) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,298 INFO L280 TraceCheckUtils]: 14: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume !!(~i~0 < ~size); {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,299 INFO L280 TraceCheckUtils]: 15: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} assume 0 <= ~i~0 && ~i~0 < 32; {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,299 INFO L280 TraceCheckUtils]: 16: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,300 INFO L280 TraceCheckUtils]: 17: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} is VALID [2020-07-29 01:01:11,301 INFO L280 TraceCheckUtils]: 18: Hoare triple {6633#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,301 INFO L280 TraceCheckUtils]: 19: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume !!(~i~0 < ~size); {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,302 INFO L280 TraceCheckUtils]: 20: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} assume 0 <= ~i~0 && ~i~0 < 32; {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,302 INFO L280 TraceCheckUtils]: 21: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,303 INFO L280 TraceCheckUtils]: 22: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} is VALID [2020-07-29 01:01:11,304 INFO L280 TraceCheckUtils]: 23: Hoare triple {6634#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,304 INFO L280 TraceCheckUtils]: 24: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume !!(~i~0 < ~size); {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,305 INFO L280 TraceCheckUtils]: 25: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} assume 0 <= ~i~0 && ~i~0 < 32; {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,306 INFO L280 TraceCheckUtils]: 26: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,306 INFO L280 TraceCheckUtils]: 27: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} is VALID [2020-07-29 01:01:11,307 INFO L280 TraceCheckUtils]: 28: Hoare triple {6635#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,307 INFO L280 TraceCheckUtils]: 29: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume !!(~i~0 < ~size); {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,308 INFO L280 TraceCheckUtils]: 30: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} assume 0 <= ~i~0 && ~i~0 < 32; {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,308 INFO L280 TraceCheckUtils]: 31: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,309 INFO L280 TraceCheckUtils]: 32: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,309 INFO L280 TraceCheckUtils]: 33: Hoare triple {6636#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 4) (not (= 32 foo_~size))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,310 INFO L280 TraceCheckUtils]: 34: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume !!(~i~0 < ~size); {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,311 INFO L280 TraceCheckUtils]: 35: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} assume 0 <= ~i~0 && ~i~0 < 32; {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,311 INFO L280 TraceCheckUtils]: 36: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,312 INFO L280 TraceCheckUtils]: 37: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} is VALID [2020-07-29 01:01:11,312 INFO L280 TraceCheckUtils]: 38: Hoare triple {6637#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,313 INFO L280 TraceCheckUtils]: 39: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume !!(~i~0 < ~size); {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,313 INFO L280 TraceCheckUtils]: 40: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} assume 0 <= ~i~0 && ~i~0 < 32; {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,314 INFO L280 TraceCheckUtils]: 41: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,315 INFO L280 TraceCheckUtils]: 42: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} is VALID [2020-07-29 01:01:11,315 INFO L280 TraceCheckUtils]: 43: Hoare triple {6638#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (not (= 32 foo_~size)) (<= foo_~i~0 6)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} is VALID [2020-07-29 01:01:11,316 INFO L280 TraceCheckUtils]: 44: Hoare triple {6639#(and (or (= 32 foo_~size) (= foo_~size |foo_#in~size|)) (or (<= foo_~i~0 7) (not (= 32 foo_~size))))} assume !(~i~0 < ~size); {6640#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:11,316 INFO L280 TraceCheckUtils]: 45: Hoare triple {6640#(not (= 32 |foo_#in~size|))} #res := ~i~0; {6640#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:11,317 INFO L280 TraceCheckUtils]: 46: Hoare triple {6640#(not (= 32 |foo_#in~size|))} assume true; {6640#(not (= 32 |foo_#in~size|))} is VALID [2020-07-29 01:01:11,317 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {6640#(not (= 32 |foo_#in~size|))} {6546#true} #78#return; {6547#false} is VALID [2020-07-29 01:01:11,318 INFO L280 TraceCheckUtils]: 48: Hoare triple {6547#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6547#false} is VALID [2020-07-29 01:01:11,318 INFO L280 TraceCheckUtils]: 49: Hoare triple {6547#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6547#false} is VALID [2020-07-29 01:01:11,318 INFO L280 TraceCheckUtils]: 50: Hoare triple {6547#false} havoc #t~ret3; {6547#false} is VALID [2020-07-29 01:01:11,318 INFO L280 TraceCheckUtils]: 51: Hoare triple {6547#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6547#false} is VALID [2020-07-29 01:01:11,318 INFO L280 TraceCheckUtils]: 52: Hoare triple {6547#false} assume !!(~i~1 < 32);~c~0.base, ~c~0.offset := ~#mask~0.base, ~#mask~0.offset; {6547#false} is VALID [2020-07-29 01:01:11,318 INFO L263 TraceCheckUtils]: 53: Hoare triple {6547#false} call #t~ret3 := foo(32, ~c~0.base, ~c~0.offset); {6546#true} is VALID [2020-07-29 01:01:11,318 INFO L280 TraceCheckUtils]: 54: Hoare triple {6546#true} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 55: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 56: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 57: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 58: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 59: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 60: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 61: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,319 INFO L280 TraceCheckUtils]: 62: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,320 INFO L280 TraceCheckUtils]: 63: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,320 INFO L280 TraceCheckUtils]: 64: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,320 INFO L280 TraceCheckUtils]: 65: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,320 INFO L280 TraceCheckUtils]: 66: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,320 INFO L280 TraceCheckUtils]: 67: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,320 INFO L280 TraceCheckUtils]: 68: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,320 INFO L280 TraceCheckUtils]: 69: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 70: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 71: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 72: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 73: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 74: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 75: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 76: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,321 INFO L280 TraceCheckUtils]: 77: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,322 INFO L280 TraceCheckUtils]: 78: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,322 INFO L280 TraceCheckUtils]: 79: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,322 INFO L280 TraceCheckUtils]: 80: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,322 INFO L280 TraceCheckUtils]: 81: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,322 INFO L280 TraceCheckUtils]: 82: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,322 INFO L280 TraceCheckUtils]: 83: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,322 INFO L280 TraceCheckUtils]: 84: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 85: Hoare triple {6546#true} assume !!(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 86: Hoare triple {6546#true} assume 0 <= ~i~0 && ~i~0 < 32; {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 87: Hoare triple {6546#true} SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~0, 1); srcloc: L16-1 {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 88: Hoare triple {6546#true} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 89: Hoare triple {6546#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 90: Hoare triple {6546#true} assume !(~i~0 < ~size); {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 91: Hoare triple {6546#true} #res := ~i~0; {6546#true} is VALID [2020-07-29 01:01:11,323 INFO L280 TraceCheckUtils]: 92: Hoare triple {6546#true} assume true; {6546#true} is VALID [2020-07-29 01:01:11,324 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {6546#true} {6547#false} #78#return; {6547#false} is VALID [2020-07-29 01:01:11,324 INFO L280 TraceCheckUtils]: 94: Hoare triple {6547#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {6547#false} is VALID [2020-07-29 01:01:11,324 INFO L280 TraceCheckUtils]: 95: Hoare triple {6547#false} SUMMARY for call write~int(#t~ret3, ~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L27-2 {6547#false} is VALID [2020-07-29 01:01:11,324 INFO L280 TraceCheckUtils]: 96: Hoare triple {6547#false} havoc #t~ret3; {6547#false} is VALID [2020-07-29 01:01:11,324 INFO L280 TraceCheckUtils]: 97: Hoare triple {6547#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {6547#false} is VALID [2020-07-29 01:01:11,324 INFO L280 TraceCheckUtils]: 98: Hoare triple {6547#false} assume !(~i~1 < 32); {6547#false} is VALID [2020-07-29 01:01:11,324 INFO L280 TraceCheckUtils]: 99: Hoare triple {6547#false} ~i~1 := 0; {6547#false} is VALID [2020-07-29 01:01:11,325 INFO L280 TraceCheckUtils]: 100: Hoare triple {6547#false} assume !!(~i~1 < 32); {6547#false} is VALID [2020-07-29 01:01:11,325 INFO L280 TraceCheckUtils]: 101: Hoare triple {6547#false} SUMMARY for call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + 4 * ~i~1, 4); srcloc: L30 {6547#false} is VALID [2020-07-29 01:01:11,325 INFO L280 TraceCheckUtils]: 102: Hoare triple {6547#false} assume 32 != #t~mem5;havoc #t~mem5; {6547#false} is VALID [2020-07-29 01:01:11,325 INFO L280 TraceCheckUtils]: 103: Hoare triple {6547#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; {6547#false} is VALID [2020-07-29 01:01:11,325 INFO L280 TraceCheckUtils]: 104: Hoare triple {6547#false} assume !(#valid == old(#valid)); {6547#false} is VALID [2020-07-29 01:01:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 3 proven. 375 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2020-07-29 01:01:11,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041975839] [2020-07-29 01:01:11,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217278661] [2020-07-29 01:01:11,338 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:11,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-29 01:01:11,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:01:11,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:01:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:11,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:11,471 INFO L350 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2020-07-29 01:01:11,471 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:11,472 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:11,478 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:11,492 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:11,492 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2020-07-29 01:01:11,495 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:11,495 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_1|]. (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_1| |v_main_~#b~0.base_BEFORE_CALL_6| 1))) (and (= 0 (select |v_old(#valid)_BEFORE_CALL_1| |v_main_~#b~0.base_BEFORE_CALL_6|)) (= 0 (select .cse0 |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= |#valid| (store .cse0 |v_main_~#mask~0.base_BEFORE_CALL_1| 1)))) [2020-07-29 01:01:11,495 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#b~0.base_BEFORE_CALL_6|, |v_main_~#mask~0.base_BEFORE_CALL_1|]. (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))) [2020-07-29 01:01:14,076 INFO L350 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2020-07-29 01:01:14,077 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:14,077 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:14,083 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:14,093 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:14,093 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2020-07-29 01:01:14,096 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:14,096 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_2|]. (let ((.cse0 (store |v_old(#valid)_BEFORE_CALL_2| |v_main_~#b~0.base_BEFORE_CALL_7| 1))) (and (= 0 (select .cse0 |v_main_~#mask~0.base_BEFORE_CALL_2|)) (= (select |v_old(#valid)_BEFORE_CALL_2| |v_main_~#b~0.base_BEFORE_CALL_7|) 0) (= |#valid| (store .cse0 |v_main_~#mask~0.base_BEFORE_CALL_2| 1)))) [2020-07-29 01:01:14,096 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_main_~#b~0.base_BEFORE_CALL_7|, |v_main_~#mask~0.base_BEFORE_CALL_2|]. (and (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_7|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_2|)) (not (= |v_main_~#b~0.base_BEFORE_CALL_7| |v_main_~#mask~0.base_BEFORE_CALL_2|))) [2020-07-29 01:01:17,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {6546#true} call ULTIMATE.init(); {6546#true} is VALID [2020-07-29 01:01:17,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {6546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {6546#true} is VALID [2020-07-29 01:01:17,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {6546#true} assume true; {6546#true} is VALID [2020-07-29 01:01:17,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6546#true} {6546#true} #74#return; {6546#true} is VALID [2020-07-29 01:01:17,476 INFO L263 TraceCheckUtils]: 4: Hoare triple {6546#true} call #t~ret6 := main(); {6656#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:01:17,478 INFO L280 TraceCheckUtils]: 5: Hoare triple {6656#(= |#valid| |old(#valid)|)} havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.allocOnStack(400);havoc ~buffer~0;call ~#mask~0.base, ~#mask~0.offset := #Ultimate.allocOnStack(32);havoc ~c~0.base, ~c~0.offset;~i~1 := 0; {6660#(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:17,479 INFO L280 TraceCheckUtils]: 6: Hoare triple {6660#(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; {6660#(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:17,482 INFO L263 TraceCheckUtils]: 7: Hoare triple {6660#(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(32, ~c~0.base, ~c~0.offset); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,487 INFO L280 TraceCheckUtils]: 12: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,487 INFO L280 TraceCheckUtils]: 13: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,488 INFO L280 TraceCheckUtils]: 14: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,488 INFO L280 TraceCheckUtils]: 15: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,489 INFO L280 TraceCheckUtils]: 16: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,490 INFO L280 TraceCheckUtils]: 17: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,490 INFO L280 TraceCheckUtils]: 18: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,491 INFO L280 TraceCheckUtils]: 19: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,492 INFO L280 TraceCheckUtils]: 20: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,493 INFO L280 TraceCheckUtils]: 21: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,494 INFO L280 TraceCheckUtils]: 22: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,494 INFO L280 TraceCheckUtils]: 23: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,495 INFO L280 TraceCheckUtils]: 24: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,495 INFO L280 TraceCheckUtils]: 25: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,496 INFO L280 TraceCheckUtils]: 26: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,497 INFO L280 TraceCheckUtils]: 27: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,498 INFO L280 TraceCheckUtils]: 28: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,498 INFO L280 TraceCheckUtils]: 29: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,499 INFO L280 TraceCheckUtils]: 30: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,500 INFO L280 TraceCheckUtils]: 31: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,501 INFO L280 TraceCheckUtils]: 32: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,502 INFO L280 TraceCheckUtils]: 33: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,503 INFO L280 TraceCheckUtils]: 34: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,504 INFO L280 TraceCheckUtils]: 35: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,505 INFO L280 TraceCheckUtils]: 36: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,506 INFO L280 TraceCheckUtils]: 37: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,507 INFO L280 TraceCheckUtils]: 38: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,508 INFO L280 TraceCheckUtils]: 39: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,509 INFO L280 TraceCheckUtils]: 40: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,510 INFO L280 TraceCheckUtils]: 41: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,511 INFO L280 TraceCheckUtils]: 42: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,512 INFO L280 TraceCheckUtils]: 43: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,513 INFO L280 TraceCheckUtils]: 44: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,513 INFO L280 TraceCheckUtils]: 45: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #res := ~i~0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,515 INFO L280 TraceCheckUtils]: 46: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume true; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,516 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} {6660#(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; {6660#(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:17,518 INFO L280 TraceCheckUtils]: 48: Hoare triple {6660#(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; {6660#(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:17,519 INFO L280 TraceCheckUtils]: 49: Hoare triple {6660#(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 {6660#(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:17,521 INFO L280 TraceCheckUtils]: 50: Hoare triple {6660#(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; {6660#(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:17,522 INFO L280 TraceCheckUtils]: 51: Hoare triple {6660#(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; {6660#(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:17,523 INFO L280 TraceCheckUtils]: 52: Hoare triple {6660#(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; {6660#(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:17,526 INFO L263 TraceCheckUtils]: 53: Hoare triple {6660#(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(32, ~c~0.base, ~c~0.offset); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,527 INFO L280 TraceCheckUtils]: 54: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~size := #in~size;~b.base, ~b.offset := #in~b.base, #in~b.offset;havoc ~a~0;havoc ~i~0;~i~0 := 0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,528 INFO L280 TraceCheckUtils]: 55: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,529 INFO L280 TraceCheckUtils]: 56: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,530 INFO L280 TraceCheckUtils]: 57: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,531 INFO L280 TraceCheckUtils]: 58: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,531 INFO L280 TraceCheckUtils]: 59: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,532 INFO L280 TraceCheckUtils]: 60: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,533 INFO L280 TraceCheckUtils]: 61: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,534 INFO L280 TraceCheckUtils]: 62: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,535 INFO L280 TraceCheckUtils]: 63: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,536 INFO L280 TraceCheckUtils]: 64: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,537 INFO L280 TraceCheckUtils]: 65: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,537 INFO L280 TraceCheckUtils]: 66: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,538 INFO L280 TraceCheckUtils]: 67: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,539 INFO L280 TraceCheckUtils]: 68: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,540 INFO L280 TraceCheckUtils]: 69: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,541 INFO L280 TraceCheckUtils]: 70: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,542 INFO L280 TraceCheckUtils]: 71: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,543 INFO L280 TraceCheckUtils]: 72: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,544 INFO L280 TraceCheckUtils]: 73: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,545 INFO L280 TraceCheckUtils]: 74: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,546 INFO L280 TraceCheckUtils]: 75: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,547 INFO L280 TraceCheckUtils]: 76: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,548 INFO L280 TraceCheckUtils]: 77: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,549 INFO L280 TraceCheckUtils]: 78: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,549 INFO L280 TraceCheckUtils]: 79: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,550 INFO L280 TraceCheckUtils]: 80: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,551 INFO L280 TraceCheckUtils]: 81: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,552 INFO L280 TraceCheckUtils]: 82: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,552 INFO L280 TraceCheckUtils]: 83: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,553 INFO L280 TraceCheckUtils]: 84: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,554 INFO L280 TraceCheckUtils]: 85: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !!(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,554 INFO L280 TraceCheckUtils]: 86: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume 0 <= ~i~0 && ~i~0 < 32; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,555 INFO L280 TraceCheckUtils]: 87: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 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 {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,555 INFO L280 TraceCheckUtils]: 88: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} ~a~0 := ~a~0[~i~0 := #t~mem1];havoc #t~mem1; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,556 INFO L280 TraceCheckUtils]: 89: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,557 INFO L280 TraceCheckUtils]: 90: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume !(~i~0 < ~size); {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,558 INFO L280 TraceCheckUtils]: 91: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} #res := ~i~0; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,559 INFO L280 TraceCheckUtils]: 92: Hoare triple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} assume true; {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} is VALID [2020-07-29 01:01:17,561 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {6667#(exists ((|v_main_~#mask~0.base_BEFORE_CALL_1| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#mask~0.base_BEFORE_CALL_1|)) (= 1 (select |#valid| |v_main_~#b~0.base_BEFORE_CALL_6|))))} {6660#(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; {6660#(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:17,562 INFO L280 TraceCheckUtils]: 94: Hoare triple {6660#(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; {6660#(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:17,564 INFO L280 TraceCheckUtils]: 95: Hoare triple {6660#(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 {6660#(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:17,565 INFO L280 TraceCheckUtils]: 96: Hoare triple {6660#(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; {6660#(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:17,566 INFO L280 TraceCheckUtils]: 97: Hoare triple {6660#(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; {6660#(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:17,567 INFO L280 TraceCheckUtils]: 98: Hoare triple {6660#(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); {6660#(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:17,569 INFO L280 TraceCheckUtils]: 99: Hoare triple {6660#(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; {6660#(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:17,570 INFO L280 TraceCheckUtils]: 100: Hoare triple {6660#(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); {6660#(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:17,571 INFO L280 TraceCheckUtils]: 101: Hoare triple {6660#(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 {6660#(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:17,573 INFO L280 TraceCheckUtils]: 102: Hoare triple {6660#(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 32 != #t~mem5;havoc #t~mem5; {6660#(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:17,575 INFO L280 TraceCheckUtils]: 103: Hoare triple {6660#(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; {6956#(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:17,577 INFO L280 TraceCheckUtils]: 104: Hoare triple {6956#(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)); {6547#false} is VALID [2020-07-29 01:01:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2020-07-29 01:01:17,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:01:17,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2020-07-29 01:01:17,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621937058] [2020-07-29 01:01:17,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-07-29 01:01:17,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:17,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:01:17,718 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:17,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-29 01:01:17,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:01:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:01:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-07-29 01:01:17,719 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 6 states. [2020-07-29 01:01:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:17,974 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2020-07-29 01:01:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:01:17,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2020-07-29 01:01:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:01:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-07-29 01:01:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:01:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-07-29 01:01:17,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2020-07-29 01:01:18,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:18,026 INFO L225 Difference]: With dead ends: 72 [2020-07-29 01:01:18,026 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:01:18,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:01:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:01:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:01:18,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:18,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:18,028 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:18,028 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:18,028 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:01:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:01:18,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:18,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:18,031 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:18,031 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:01:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:18,031 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:01:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:01:18,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:18,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:18,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:18,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:01:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:01:18,033 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2020-07-29 01:01:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:18,033 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:01:18,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-29 01:01:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:01:18,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:18,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:01:18,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:01:18 BoogieIcfgContainer [2020-07-29 01:01:18,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:01:18,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:01:18,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:01:18,242 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:01:18,243 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:45" (3/4) ... [2020-07-29 01:01:18,247 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:01:18,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:01:18,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2020-07-29 01:01:18,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:01:18,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-07-29 01:01:18,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-07-29 01:01:18,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-29 01:01:18,259 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:01:18,303 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:01:18,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:01:18,306 INFO L168 Benchmark]: Toolchain (without parser) took 33837.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 463.5 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -200.6 MB). Peak memory consumption was 262.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:18,306 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:01:18,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.98 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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:18,307 INFO L168 Benchmark]: Boogie Preprocessor took 97.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -147.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:18,308 INFO L168 Benchmark]: RCFGBuilder took 506.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:18,308 INFO L168 Benchmark]: TraceAbstraction took 32869.19 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -115.8 MB). Peak memory consumption was 249.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:18,308 INFO L168 Benchmark]: Witness Printer took 61.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:18,310 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 294.98 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -147.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 506.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32869.19 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -115.8 MB). Peak memory consumption was 249.1 MB. Max. memory is 11.5 GB. * Witness Printer took 61.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. 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: 32.8s, OverallIterations: 20, TraceHistogramMax: 14, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 516 SDtfs, 1063 SDslu, 1661 SDs, 0 SdLazy, 1795 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 887 GetRequests, 654 SyntacticMatches, 10 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 105 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 1380 NumberOfCodeBlocks, 1157 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1345 ConstructedInterpolants, 245 QuantifiedInterpolants, 656330 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 35 InterpolantComputations, 11 PerfectInterpolantSequences, 2002/3504 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...