./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i -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 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:11,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:11,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:11,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:11,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:11,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:11,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:11,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:11,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:11,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:11,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:11,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:11,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:11,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:11,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:11,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:11,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:11,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:11,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:11,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:11,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:11,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:11,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:11,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:11,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:11,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:11,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:11,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:11,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:11,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:11,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:11,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:11,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:11,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:11,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:11,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:11,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:11,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:11,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:11,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:11,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:11,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:51:11,537 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:11,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:11,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:11,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:11,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:11,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:11,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:11,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:11,540 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:11,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:11,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:11,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:11,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:11,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:11,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:11,541 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:11,541 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:11,541 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:11,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:11,542 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:11,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:11,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:11,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:11,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:11,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:11,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:11,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:11,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:11,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:51:11,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:51:11,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2022-02-20 23:51:11,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:11,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:11,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:11,721 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:11,722 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:11,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-02-20 23:51:11,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4500c748d/1eaceae0964147c08aac263bde056a0e/FLAG02abe4423 [2022-02-20 23:51:12,141 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:12,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-02-20 23:51:12,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4500c748d/1eaceae0964147c08aac263bde056a0e/FLAG02abe4423 [2022-02-20 23:51:12,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4500c748d/1eaceae0964147c08aac263bde056a0e [2022-02-20 23:51:12,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:12,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:12,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:12,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:12,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:12,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:12" (1/1) ... [2022-02-20 23:51:12,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678e5dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:12, skipping insertion in model container [2022-02-20 23:51:12,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:12" (1/1) ... [2022-02-20 23:51:12,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:12,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:12,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:12,533 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:51:12,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@374e0d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:12, skipping insertion in model container [2022-02-20 23:51:12,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:12,534 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:51:12,536 INFO L158 Benchmark]: Toolchain (without parser) took 373.75ms. Allocated memory is still 109.1MB. Free memory was 74.6MB in the beginning and 78.5MB in the end (delta: -3.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:51:12,536 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:12,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.20ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 78.5MB in the end (delta: -4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:51:12,537 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.20ms. Allocated memory is still 109.1MB. Free memory was 74.3MB in the beginning and 78.5MB in the end (delta: -4.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:13,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:13,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:13,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:13,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:13,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:13,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:13,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:13,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:13,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:13,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:13,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:13,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:13,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:13,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:13,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:13,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:13,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:13,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:13,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:13,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:13,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:13,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:13,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:13,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:14,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:14,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:14,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:14,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:14,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:14,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:14,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:14,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:14,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:14,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:14,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:14,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:14,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:14,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:14,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:14,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:14,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:51:14,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:14,035 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:14,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:14,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:14,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:14,036 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:14,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:14,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:14,038 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:14,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:14,038 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:14,038 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:14,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:14,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:14,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:14,039 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:14,039 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:14,040 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:14,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:14,040 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:14,040 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:51:14,040 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:51:14,040 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:14,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:14,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:14,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:14,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:14,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:14,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:14,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:14,041 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:51:14,042 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:14,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:51:14,042 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38a2fba2a92db51b6a97ddc82d5dc9e2df7a8770315ef841bfaf5f0764404946 [2022-02-20 23:51:14,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:14,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:14,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:14,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:14,337 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:14,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-02-20 23:51:14,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207b4a8e0/b49b89aa4db24e4f91d7480dd7b8a2b2/FLAGce7a50ebf [2022-02-20 23:51:14,797 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:14,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_3.i [2022-02-20 23:51:14,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207b4a8e0/b49b89aa4db24e4f91d7480dd7b8a2b2/FLAGce7a50ebf [2022-02-20 23:51:15,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207b4a8e0/b49b89aa4db24e4f91d7480dd7b8a2b2 [2022-02-20 23:51:15,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:15,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:15,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:15,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:15,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:15,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12fbd06c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15, skipping insertion in model container [2022-02-20 23:51:15,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:15,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:15,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:15,562 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:51:15,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:15,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:15,623 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:51:15,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:15,736 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:51:15,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15 WrapperNode [2022-02-20 23:51:15,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:15,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:15,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:51:15,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:51:15,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,773 INFO L137 Inliner]: procedures = 166, calls = 76, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 70 [2022-02-20 23:51:15,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:15,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:51:15,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:51:15,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:51:15,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:51:15,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:51:15,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:51:15,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:51:15,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (1/1) ... [2022-02-20 23:51:15,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:15,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:51:15,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:51:15,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:51:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:51:15,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:51:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:51:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:51:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:51:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:51:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:51:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:51:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:51:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:51:15,966 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:51:15,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:51:16,265 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:51:16,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:51:16,270 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:51:16,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:16 BoogieIcfgContainer [2022-02-20 23:51:16,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:51:16,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:51:16,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:51:16,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:51:16,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:51:15" (1/3) ... [2022-02-20 23:51:16,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adff790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:16, skipping insertion in model container [2022-02-20 23:51:16,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:15" (2/3) ... [2022-02-20 23:51:16,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adff790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:16, skipping insertion in model container [2022-02-20 23:51:16,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:16" (3/3) ... [2022-02-20 23:51:16,281 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test17_3.i [2022-02-20 23:51:16,284 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:51:16,284 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-02-20 23:51:16,324 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:51:16,330 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:51:16,330 INFO L340 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-02-20 23:51:16,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:16,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:16,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:16,352 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:16,357 INFO L85 PathProgramCache]: Analyzing trace with hash 714233942, now seen corresponding path program 1 times [2022-02-20 23:51:16,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:16,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129479218] [2022-02-20 23:51:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:16,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:16,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:16,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:16,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:51:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:16,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:51:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:16,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:16,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {55#true} is VALID [2022-02-20 23:51:16,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {55#true} is VALID [2022-02-20 23:51:16,541 INFO L272 TraceCheckUtils]: 2: Hoare triple {55#true} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {55#true} is VALID [2022-02-20 23:51:16,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {55#true} ~size := #in~size; {55#true} is VALID [2022-02-20 23:51:16,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {55#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {72#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:16,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {72#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {72#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:16,544 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {72#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {55#true} #100#return; {79#(not (= |ULTIMATE.start_entry_point_#t~ret42#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:16,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {79#(not (= |ULTIMATE.start_entry_point_#t~ret42#1.base| (_ bv0 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {83#(not (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:16,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {83#(not (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)))} assume !(entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32); {56#false} is VALID [2022-02-20 23:51:16,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#false} assume { :end_inline_entry_point } true; {56#false} is VALID [2022-02-20 23:51:16,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#false} assume !(#valid == main_old_#valid#1); {56#false} is VALID [2022-02-20 23:51:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:16,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:16,548 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:16,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129479218] [2022-02-20 23:51:16,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129479218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:16,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:16,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:16,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240141183] [2022-02-20 23:51:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:16,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:16,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:16,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:16,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:16,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:16,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:16,597 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 48 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:16,994 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-02-20 23:51:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-02-20 23:51:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-02-20 23:51:17,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 118 transitions. [2022-02-20 23:51:17,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:17,120 INFO L225 Difference]: With dead ends: 98 [2022-02-20 23:51:17,120 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:51:17,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:17,124 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:17,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 202 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:17,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:51:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2022-02-20 23:51:17,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:17,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 54 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,146 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 54 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,147 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 54 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:17,152 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-02-20 23:51:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-02-20 23:51:17,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:17,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:17,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 94 states. [2022-02-20 23:51:17,154 INFO L87 Difference]: Start difference. First operand has 54 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 94 states. [2022-02-20 23:51:17,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:17,159 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2022-02-20 23:51:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-02-20 23:51:17,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:17,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:17,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:17,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 49 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-02-20 23:51:17,164 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 11 [2022-02-20 23:51:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:17,164 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-02-20 23:51:17,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,165 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-02-20 23:51:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:17,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:17,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:17,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:51:17,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:17,369 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:17,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:17,370 INFO L85 PathProgramCache]: Analyzing trace with hash 714155687, now seen corresponding path program 1 times [2022-02-20 23:51:17,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:17,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933198652] [2022-02-20 23:51:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:17,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:17,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:17,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:17,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:51:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:17,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:17,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:17,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:17,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {432#true} is VALID [2022-02-20 23:51:17,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {432#true} is VALID [2022-02-20 23:51:17,492 INFO L272 TraceCheckUtils]: 2: Hoare triple {432#true} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {432#true} is VALID [2022-02-20 23:51:17,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {432#true} ~size := #in~size; {432#true} is VALID [2022-02-20 23:51:17,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {432#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {449#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:17,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {449#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:51:17,495 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {449#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {432#true} #100#return; {456#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:17,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv1 1))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {460#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:17,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {460#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:17,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {460#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:51:17,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~array~0#1.base]); {433#false} is VALID [2022-02-20 23:51:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:17,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:17,497 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:17,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933198652] [2022-02-20 23:51:17,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933198652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:17,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:17,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:51:17,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452897756] [2022-02-20 23:51:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:17,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:17,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:17,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:17,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:17,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:17,510 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:17,897 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-02-20 23:51:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-02-20 23:51:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-02-20 23:51:17,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2022-02-20 23:51:17,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:17,974 INFO L225 Difference]: With dead ends: 67 [2022-02-20 23:51:17,974 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 23:51:17,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:17,975 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:17,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 140 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 23:51:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-02-20 23:51:17,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:17,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 63 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,979 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 63 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,980 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 63 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:17,982 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-02-20 23:51:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-02-20 23:51:17,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:17,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:17,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 67 states. [2022-02-20 23:51:17,983 INFO L87 Difference]: Start difference. First operand has 63 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 67 states. [2022-02-20 23:51:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:17,986 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-02-20 23:51:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-02-20 23:51:17,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:17,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:17,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:17,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-02-20 23:51:17,989 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 11 [2022-02-20 23:51:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:17,990 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-02-20 23:51:17,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-02-20 23:51:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:17,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:17,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:18,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:18,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:18,197 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:18,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash 714155688, now seen corresponding path program 1 times [2022-02-20 23:51:18,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:18,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094558169] [2022-02-20 23:51:18,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:18,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:18,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:18,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:18,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:51:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:18,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:51:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:18,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:18,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:18,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {733#true} is VALID [2022-02-20 23:51:18,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {741#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:18,356 INFO L272 TraceCheckUtils]: 2: Hoare triple {741#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {733#true} is VALID [2022-02-20 23:51:18,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {733#true} ~size := #in~size; {748#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:18,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {748#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {752#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:18,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {752#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {752#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:18,359 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {752#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {741#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {759#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:18,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {759#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {763#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:18,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {763#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {767#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:18,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {767#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {767#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:18,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)))); {734#false} is VALID [2022-02-20 23:51:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:18,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:18,361 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:18,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094558169] [2022-02-20 23:51:18,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094558169] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:18,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:18,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:51:18,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002978283] [2022-02-20 23:51:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:18,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:18,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:18,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:18,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:18,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:51:18,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:18,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:51:18,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:51:18,375 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:19,229 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-02-20 23:51:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:51:19,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:19,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-02-20 23:51:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2022-02-20 23:51:19,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 86 transitions. [2022-02-20 23:51:19,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:19,320 INFO L225 Difference]: With dead ends: 82 [2022-02-20 23:51:19,321 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 23:51:19,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:51:19,322 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 72 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:19,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 255 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:51:19,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 23:51:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2022-02-20 23:51:19,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:19,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 68 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:19,326 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 68 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:19,327 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 68 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:19,329 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-02-20 23:51:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2022-02-20 23:51:19,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:19,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:19,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 68 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 82 states. [2022-02-20 23:51:19,330 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 68 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 82 states. [2022-02-20 23:51:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:19,333 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-02-20 23:51:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2022-02-20 23:51:19,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:19,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:19,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:19,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 68 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-02-20 23:51:19,336 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 11 [2022-02-20 23:51:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:19,336 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-02-20 23:51:19,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,336 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-02-20 23:51:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:19,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:19,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:19,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:51:19,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:19,544 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1601737623, now seen corresponding path program 1 times [2022-02-20 23:51:19,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:19,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244112076] [2022-02-20 23:51:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:19,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:19,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:51:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:19,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:51:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:19,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:19,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {1100#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1100#true} is VALID [2022-02-20 23:51:19,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:19,611 INFO L272 TraceCheckUtils]: 2: Hoare triple {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {1112#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:19,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {1112#(= |old(#valid)| |#valid|)} ~size := #in~size; {1112#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:19,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {1112#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1112#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:19,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {1112#(= |old(#valid)| |#valid|)} assume true; {1112#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:51:19,613 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1112#(= |old(#valid)| |#valid|)} {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #100#return; {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:19,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:19,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32); {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:19,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:51:19,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {1101#false} is VALID [2022-02-20 23:51:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:19,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:19,615 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:19,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244112076] [2022-02-20 23:51:19,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244112076] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:19,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:19,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:51:19,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078156058] [2022-02-20 23:51:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:19,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:19,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:19,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:51:19,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:51:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:19,628 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:19,988 INFO L93 Difference]: Finished difference Result 106 states and 125 transitions. [2022-02-20 23:51:19,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:51:19,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-02-20 23:51:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-02-20 23:51:19,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 102 transitions. [2022-02-20 23:51:20,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:20,072 INFO L225 Difference]: With dead ends: 106 [2022-02-20 23:51:20,072 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:51:20,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:20,073 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:20,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 165 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:51:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73. [2022-02-20 23:51:20,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:20,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:20,077 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:20,077 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:20,080 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-02-20 23:51:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-02-20 23:51:20,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:20,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:20,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 104 states. [2022-02-20 23:51:20,081 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 104 states. [2022-02-20 23:51:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:20,084 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-02-20 23:51:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2022-02-20 23:51:20,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:20,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:20,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:20,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 68 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:51:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2022-02-20 23:51:20,087 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 11 [2022-02-20 23:51:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:20,087 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2022-02-20 23:51:20,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2022-02-20 23:51:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:20,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:20,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:20,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:20,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:20,294 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1601659368, now seen corresponding path program 1 times [2022-02-20 23:51:20,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:20,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337889718] [2022-02-20 23:51:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:20,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:20,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:20,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:20,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:51:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:20,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:51:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:20,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:20,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1523#true} is VALID [2022-02-20 23:51:20,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {1523#true} is VALID [2022-02-20 23:51:20,413 INFO L272 TraceCheckUtils]: 2: Hoare triple {1523#true} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {1523#true} is VALID [2022-02-20 23:51:20,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {1523#true} ~size := #in~size; {1523#true} is VALID [2022-02-20 23:51:20,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {1523#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1540#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:20,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {1540#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1540#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:20,417 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1540#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {1523#true} #100#return; {1547#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= |ULTIMATE.start_entry_point_#t~ret42#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:20,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {1547#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= |ULTIMATE.start_entry_point_#t~ret42#1.base| (_ bv0 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {1551#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:20,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {1551#(and (= |ULTIMATE.start_entry_point_~array~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {1524#false} is VALID [2022-02-20 23:51:20,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {1524#false} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {1524#false} is VALID [2022-02-20 23:51:20,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {1524#false} assume !(1bv1 == #valid[entry_point_~array~0#1.base]); {1524#false} is VALID [2022-02-20 23:51:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:20,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:20,420 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:20,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337889718] [2022-02-20 23:51:20,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337889718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:20,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:20,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:20,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654079769] [2022-02-20 23:51:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:20,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:20,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:20,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:20,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:51:20,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:51:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:20,431 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:20,675 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-02-20 23:51:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:51:20,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:51:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 23:51:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 23:51:20,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-02-20 23:51:20,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:20,731 INFO L225 Difference]: With dead ends: 61 [2022-02-20 23:51:20,731 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 23:51:20,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:20,732 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:20,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 23:51:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-20 23:51:20,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:20,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:20,734 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:20,735 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:20,736 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-02-20 23:51:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-02-20 23:51:20,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:20,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:20,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 59 states. [2022-02-20 23:51:20,737 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 59 states. [2022-02-20 23:51:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:20,738 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-02-20 23:51:20,739 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-02-20 23:51:20,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:20,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:20,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:20,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-02-20 23:51:20,741 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 11 [2022-02-20 23:51:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:20,741 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-02-20 23:51:20,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-02-20 23:51:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:51:20,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:20,742 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:20,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:20,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:20,944 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1855917097, now seen corresponding path program 1 times [2022-02-20 23:51:20,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:20,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614815692] [2022-02-20 23:51:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:20,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:20,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:20,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:51:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:20,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:51:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:21,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:21,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:21,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1798#true} is VALID [2022-02-20 23:51:21,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {1806#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:21,174 INFO L272 TraceCheckUtils]: 2: Hoare triple {1806#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {1798#true} is VALID [2022-02-20 23:51:21,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} ~size := #in~size; {1813#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:21,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {1813#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1817#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:21,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {1817#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {1817#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:21,178 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1817#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1806#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {1824#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:21,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {1824#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {1828#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:21,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {1832#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:21,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {1832#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {1832#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:21,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {1832#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {1832#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:21,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {1832#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {1842#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:21,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {1842#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {1842#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:21,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {1842#(and (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)))); {1799#false} is VALID [2022-02-20 23:51:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:21,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:21,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {1849#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)))); {1799#false} is VALID [2022-02-20 23:51:21,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {1849#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {1849#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} is VALID [2022-02-20 23:51:22,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {1856#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {1849#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} is VALID [2022-02-20 23:51:22,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1856#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {1856#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} is VALID [2022-02-20 23:51:22,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {1856#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {1856#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} is VALID [2022-02-20 23:51:22,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {1866#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {1856#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} is VALID [2022-02-20 23:51:22,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {1870#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {1866#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)))} is VALID [2022-02-20 23:51:22,454 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1878#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} {1874#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} #100#return; {1870#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)))} is VALID [2022-02-20 23:51:22,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1878#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} assume true; {1878#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} is VALID [2022-02-20 23:51:22,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {1885#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))) (bvule (_ bv8 32) ldv_malloc_~size))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1878#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))))} is VALID [2022-02-20 23:51:22,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {1798#true} ~size := #in~size; {1885#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4| (_ BitVec 32))) (or (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|) |ldv_malloc_#in~size|)) (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_4|))))) (bvule (_ bv8 32) ldv_malloc_~size))} is VALID [2022-02-20 23:51:22,468 INFO L272 TraceCheckUtils]: 2: Hoare triple {1874#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {1798#true} is VALID [2022-02-20 23:51:22,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {1874#(bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|))} is VALID [2022-02-20 23:51:22,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1798#true} is VALID [2022-02-20 23:51:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:22,469 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:22,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614815692] [2022-02-20 23:51:22,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614815692] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:22,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:22,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-02-20 23:51:22,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040225716] [2022-02-20 23:51:22,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-02-20 23:51:22,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:22,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:22,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:22,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:51:22,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:22,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:51:22,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:51:22,977 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:25,019 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-02-20 23:51:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:51:25,019 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2022-02-20 23:51:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2022-02-20 23:51:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2022-02-20 23:51:25,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 114 transitions. [2022-02-20 23:51:25,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:25,162 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:51:25,163 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:51:25,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:51:25,163 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 177 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:25,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 301 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 192 Invalid, 0 Unknown, 75 Unchecked, 0.6s Time] [2022-02-20 23:51:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:51:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2022-02-20 23:51:25,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:25,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:25,167 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:25,167 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:25,169 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-02-20 23:51:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2022-02-20 23:51:25,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:25,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:25,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 97 states. [2022-02-20 23:51:25,170 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 97 states. [2022-02-20 23:51:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:25,172 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-02-20 23:51:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2022-02-20 23:51:25,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:25,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:25,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:25,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-02-20 23:51:25,174 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 14 [2022-02-20 23:51:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:25,175 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-02-20 23:51:25,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-02-20 23:51:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:51:25,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:25,175 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:25,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:25,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:25,384 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash 854181427, now seen corresponding path program 1 times [2022-02-20 23:51:25,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:25,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047832873] [2022-02-20 23:51:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:25,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:25,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:25,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:25,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:51:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:25,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:25,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:25,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {2267#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2267#true} is VALID [2022-02-20 23:51:25,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {2267#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {2275#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:25,530 INFO L272 TraceCheckUtils]: 2: Hoare triple {2275#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {2267#true} is VALID [2022-02-20 23:51:25,530 INFO L290 TraceCheckUtils]: 3: Hoare triple {2267#true} ~size := #in~size; {2267#true} is VALID [2022-02-20 23:51:25,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {2267#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2267#true} is VALID [2022-02-20 23:51:25,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {2267#true} assume true; {2267#true} is VALID [2022-02-20 23:51:25,531 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2267#true} {2275#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {2275#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:25,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {2275#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {2275#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:25,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {2275#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {2297#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:25,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2297#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:25,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {2297#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2297#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:25,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {2297#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2307#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:25,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {2307#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2307#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:25,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {2307#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2307#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:25,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {2307#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2317#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:25,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {2317#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} assume !~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2268#false} is VALID [2022-02-20 23:51:25,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {2268#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {2268#false} is VALID [2022-02-20 23:51:25,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {2268#false} assume !~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {2268#false} is VALID [2022-02-20 23:51:25,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {2268#false} alloc_17_#res#1 := 0bv32; {2268#false} is VALID [2022-02-20 23:51:25,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {2268#false} entry_point_#t~ret44#1 := alloc_17_#res#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret44#1; {2268#false} is VALID [2022-02-20 23:51:25,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {2268#false} assume 0bv32 == entry_point_~array~0#1.offset; {2268#false} is VALID [2022-02-20 23:51:25,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {2268#false} assume !~bvult32(entry_point_~array~0#1.base, #StackHeapBarrier); {2268#false} is VALID [2022-02-20 23:51:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:25,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:25,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {2268#false} assume !~bvult32(entry_point_~array~0#1.base, #StackHeapBarrier); {2268#false} is VALID [2022-02-20 23:51:25,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {2268#false} assume 0bv32 == entry_point_~array~0#1.offset; {2268#false} is VALID [2022-02-20 23:51:25,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {2268#false} entry_point_#t~ret44#1 := alloc_17_#res#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret44#1; {2268#false} is VALID [2022-02-20 23:51:25,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {2268#false} alloc_17_#res#1 := 0bv32; {2268#false} is VALID [2022-02-20 23:51:25,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {2268#false} assume !~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {2268#false} is VALID [2022-02-20 23:51:25,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {2268#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {2268#false} is VALID [2022-02-20 23:51:25,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {2357#(bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)} assume !~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2268#false} is VALID [2022-02-20 23:51:25,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {2361#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2357#(bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {2361#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2361#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {2361#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2361#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {2371#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2361#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {2371#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2371#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {2371#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2371#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2381#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {2371#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {2381#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {2381#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,700 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2267#true} {2381#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} #100#return; {2381#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {2267#true} assume true; {2267#true} is VALID [2022-02-20 23:51:25,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {2267#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2267#true} is VALID [2022-02-20 23:51:25,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {2267#true} ~size := #in~size; {2267#true} is VALID [2022-02-20 23:51:25,700 INFO L272 TraceCheckUtils]: 2: Hoare triple {2381#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {2267#true} is VALID [2022-02-20 23:51:25,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {2267#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {2381#(bvslt (_ bv2 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:25,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {2267#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2267#true} is VALID [2022-02-20 23:51:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:25,701 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:25,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047832873] [2022-02-20 23:51:25,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047832873] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:25,701 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:25,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-20 23:51:25,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167188202] [2022-02-20 23:51:25,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 23:51:25,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:25,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:25,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:25,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:51:25,764 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:25,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:51:25,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:51:25,765 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:26,226 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-02-20 23:51:26,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:51:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-02-20 23:51:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-02-20 23:51:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-02-20 23:51:26,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2022-02-20 23:51:26,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:26,298 INFO L225 Difference]: With dead ends: 74 [2022-02-20 23:51:26,298 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 23:51:26,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:51:26,299 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 125 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:26,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 187 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 23:51:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-02-20 23:51:26,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:26,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:26,303 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:26,304 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:26,305 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-02-20 23:51:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-02-20 23:51:26,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:26,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:26,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 74 states. [2022-02-20 23:51:26,306 INFO L87 Difference]: Start difference. First operand has 73 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 74 states. [2022-02-20 23:51:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:26,307 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-02-20 23:51:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-02-20 23:51:26,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:26,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:26,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:26,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2022-02-20 23:51:26,309 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 22 [2022-02-20 23:51:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:26,309 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2022-02-20 23:51:26,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2022-02-20 23:51:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:51:26,310 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:26,310 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:26,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:26,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:26,516 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:26,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1071704552, now seen corresponding path program 2 times [2022-02-20 23:51:26,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:26,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862520589] [2022-02-20 23:51:26,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:51:26,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:26,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:26,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:26,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:51:26,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:51:26,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:26,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:51:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:26,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:26,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:26,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {2706#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2706#true} is VALID [2022-02-20 23:51:26,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {2706#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {2714#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:26,997 INFO L272 TraceCheckUtils]: 2: Hoare triple {2714#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {2706#true} is VALID [2022-02-20 23:51:26,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {2706#true} ~size := #in~size; {2721#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:26,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {2721#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2725#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:26,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {2725#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2725#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,000 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2725#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2714#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {2732#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|))} is VALID [2022-02-20 23:51:27,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {2732#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {2736#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {2736#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {2740#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {2740#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2740#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {2740#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2740#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {2740#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2750#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {2750#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2750#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {2750#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2750#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {2750#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2760#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {2760#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2760#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {2760#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2760#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:27,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {2760#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2770#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:27,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {2770#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2770#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:27,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {2770#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2770#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:27,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {2770#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2780#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:27,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2784#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:51:27,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {2784#(and (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)))); {2707#false} is VALID [2022-02-20 23:51:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:27,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:28,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {2788#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)))); {2707#false} is VALID [2022-02-20 23:51:28,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {2792#(or (not (bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2788#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} is VALID [2022-02-20 23:51:29,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {2796#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2792#(or (not (bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} is VALID [2022-02-20 23:51:29,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {2796#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2796#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:29,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {2796#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2796#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:29,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {2806#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2796#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:29,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {2806#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2806#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:29,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {2806#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2806#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:30,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {2816#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2806#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:30,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {2816#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2816#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:30,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {2816#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2816#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:30,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {2826#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {2816#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:30,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {2826#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {2826#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:30,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {2826#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {2826#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:30,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {2836#(or (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {2826#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:30,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {2840#(or (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv20 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (bvadd (_ bv20 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|))))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {2836#(or (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset|) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:31,002 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2848#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} {2844#(or (bvule (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} #100#return; {2840#(or (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd (_ bv20 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (bvadd (_ bv20 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|))))} is VALID [2022-02-20 23:51:31,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {2848#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} assume true; {2848#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} is VALID [2022-02-20 23:51:31,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {2855#(or (bvule (_ bv20 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2848#(or (and (bvule (bvadd (_ bv16 32) |ldv_malloc_#res.offset|) (bvadd |ldv_malloc_#res.offset| (_ bv20 32))) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv20 32)) (select |#length| |ldv_malloc_#res.base|))) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} is VALID [2022-02-20 23:51:31,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {2706#true} ~size := #in~size; {2855#(or (bvule (_ bv20 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9| (_ BitVec 32))) (or (not (bvule (_ bv20 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (= |ldv_malloc_#in~size| (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|))) (not (bvslt (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_9|)))))} is VALID [2022-02-20 23:51:31,005 INFO L272 TraceCheckUtils]: 2: Hoare triple {2844#(or (bvule (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {2706#true} is VALID [2022-02-20 23:51:31,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {2706#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {2844#(or (bvule (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)) (not (bvslt (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:31,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {2706#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2706#true} is VALID [2022-02-20 23:51:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:31,006 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:31,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862520589] [2022-02-20 23:51:31,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862520589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:31,007 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:31,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-02-20 23:51:31,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112396101] [2022-02-20 23:51:31,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:31,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-02-20 23:51:31,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:31,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:34,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:34,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:51:34,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:51:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:51:34,525 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:39,950 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-02-20 23:51:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-20 23:51:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-02-20 23:51:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 108 transitions. [2022-02-20 23:51:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 108 transitions. [2022-02-20 23:51:39,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 108 transitions. [2022-02-20 23:51:40,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:40,133 INFO L225 Difference]: With dead ends: 91 [2022-02-20 23:51:40,133 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 23:51:40,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 23:51:40,134 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 317 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:40,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 421 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 391 Invalid, 0 Unknown, 75 Unchecked, 1.3s Time] [2022-02-20 23:51:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 23:51:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-02-20 23:51:40,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:40,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,137 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,137 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:40,139 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-02-20 23:51:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-02-20 23:51:40,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:40,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:40,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 91 states. [2022-02-20 23:51:40,140 INFO L87 Difference]: Start difference. First operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 91 states. [2022-02-20 23:51:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:40,142 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-02-20 23:51:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-02-20 23:51:40,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:40,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:40,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:40,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2022-02-20 23:51:40,144 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 23 [2022-02-20 23:51:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:40,144 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2022-02-20 23:51:40,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:51:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2022-02-20 23:51:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:51:40,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:40,145 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:40,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:51:40,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:40,352 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1134263027, now seen corresponding path program 2 times [2022-02-20 23:51:40,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:40,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551770795] [2022-02-20 23:51:40,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:51:40,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:40,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:40,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:40,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:51:40,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:51:40,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:40,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:51:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:40,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:40,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {3245#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3245#true} is VALID [2022-02-20 23:51:40,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {3245#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,481 INFO L272 TraceCheckUtils]: 2: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {3245#true} is VALID [2022-02-20 23:51:40,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {3245#true} ~size := #in~size; {3245#true} is VALID [2022-02-20 23:51:40,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {3245#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3245#true} is VALID [2022-02-20 23:51:40,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {3245#true} assume true; {3245#true} is VALID [2022-02-20 23:51:40,482 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3245#true} {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume !~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:40,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {3253#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {3335#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (_ bv10 32) |ULTIMATE.start_alloc_17_~len#1|))} is VALID [2022-02-20 23:51:40,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {3335#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (_ bv10 32) |ULTIMATE.start_alloc_17_~len#1|))} assume !~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {3246#false} is VALID [2022-02-20 23:51:40,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {3246#false} alloc_17_#res#1 := 0bv32; {3246#false} is VALID [2022-02-20 23:51:40,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {3246#false} entry_point_#t~ret44#1 := alloc_17_#res#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret44#1; {3246#false} is VALID [2022-02-20 23:51:40,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {3246#false} assume 0bv32 == entry_point_~array~0#1.offset; {3246#false} is VALID [2022-02-20 23:51:40,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {3246#false} assume !~bvult32(entry_point_~array~0#1.base, #StackHeapBarrier); {3246#false} is VALID [2022-02-20 23:51:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-02-20 23:51:40,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:40,495 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:40,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551770795] [2022-02-20 23:51:40,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551770795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:40,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:40,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:51:40,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826691202] [2022-02-20 23:51:40,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:51:40,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:40,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:40,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:40,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:51:40,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:51:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:51:40,512 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:40,673 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-02-20 23:51:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:51:40,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:51:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-02-20 23:51:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-02-20 23:51:40,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-02-20 23:51:40,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:40,755 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:51:40,755 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 23:51:40,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:51:40,756 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 104 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:40,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 23:51:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2022-02-20 23:51:40,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:40,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,759 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,759 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:40,761 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-02-20 23:51:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-02-20 23:51:40,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:40,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:40,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 114 states. [2022-02-20 23:51:40,762 INFO L87 Difference]: Start difference. First operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 114 states. [2022-02-20 23:51:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:40,764 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-02-20 23:51:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-02-20 23:51:40,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:40,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:40,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:40,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 77 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-02-20 23:51:40,766 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 34 [2022-02-20 23:51:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:40,766 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-02-20 23:51:40,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:51:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-02-20 23:51:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 23:51:40,767 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:40,767 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:40,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:40,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:40,973 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash 269265368, now seen corresponding path program 1 times [2022-02-20 23:51:40,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:40,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282603103] [2022-02-20 23:51:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:40,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:40,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:40,975 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:40,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:51:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:41,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:41,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:41,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {3775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3775#true} is VALID [2022-02-20 23:51:41,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {3775#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {3783#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:41,313 INFO L272 TraceCheckUtils]: 2: Hoare triple {3783#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {3775#true} is VALID [2022-02-20 23:51:41,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {3775#true} ~size := #in~size; {3775#true} is VALID [2022-02-20 23:51:41,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {3775#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3775#true} is VALID [2022-02-20 23:51:41,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {3775#true} assume true; {3775#true} is VALID [2022-02-20 23:51:41,315 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3775#true} {3783#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {3783#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:41,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {3783#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {3783#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:41,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {3783#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {3805#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:41,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {3805#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3805#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:41,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {3805#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3805#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:51:41,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {3805#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3815#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:41,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {3815#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3815#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:41,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {3815#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3815#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} is VALID [2022-02-20 23:51:41,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {3815#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3825#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:41,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {3825#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3825#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:41,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {3825#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3825#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:41,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {3825#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3835#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:41,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {3835#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3835#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:41,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {3835#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3835#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:41,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {3835#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv1 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3845#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:41,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {3845#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3845#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:41,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {3845#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3845#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:41,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {3845#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3855#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)))} is VALID [2022-02-20 23:51:41,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {3855#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3855#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)))} is VALID [2022-02-20 23:51:41,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {3855#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3855#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)))} is VALID [2022-02-20 23:51:41,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {3855#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3865#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv5 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:41,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {3865#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv5 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} assume !~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {3776#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {3776#false} assume !!~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L272 TraceCheckUtils]: 30: Hoare triple {3776#false} call alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc(4bv32); {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {3776#false} ~size := #in~size; {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {3776#false} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {3776#false} assume true; {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3776#false} {3776#false} #102#return; {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {3776#false} alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {3776#false} assume !(alloc_17_~p~0#1.base == 0bv32 && alloc_17_~p~0#1.offset == 0bv32); {3776#false} is VALID [2022-02-20 23:51:41,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {3776#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))), #length[alloc_17_~array#1.base]) && ~bvule32(~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)))); {3776#false} is VALID [2022-02-20 23:51:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:41,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:41,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {3776#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))), #length[alloc_17_~array#1.base]) && ~bvule32(~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)))); {3776#false} is VALID [2022-02-20 23:51:41,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {3776#false} assume !(alloc_17_~p~0#1.base == 0bv32 && alloc_17_~p~0#1.offset == 0bv32); {3776#false} is VALID [2022-02-20 23:51:41,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {3776#false} alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; {3776#false} is VALID [2022-02-20 23:51:41,634 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3775#true} {3776#false} #102#return; {3776#false} is VALID [2022-02-20 23:51:41,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {3775#true} assume true; {3775#true} is VALID [2022-02-20 23:51:41,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {3775#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3775#true} is VALID [2022-02-20 23:51:41,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {3775#true} ~size := #in~size; {3775#true} is VALID [2022-02-20 23:51:41,635 INFO L272 TraceCheckUtils]: 30: Hoare triple {3776#false} call alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc(4bv32); {3775#true} is VALID [2022-02-20 23:51:41,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {3776#false} assume !!~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {3776#false} is VALID [2022-02-20 23:51:41,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {3776#false} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {3776#false} is VALID [2022-02-20 23:51:41,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {3929#(bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)} assume !~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3776#false} is VALID [2022-02-20 23:51:41,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {3933#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3929#(bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {3933#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3933#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {3933#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3933#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {3943#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3933#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {3943#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3943#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {3943#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3943#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {3953#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3943#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {3953#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3953#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {3953#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3953#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {3963#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3953#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {3963#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3963#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {3963#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3963#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {3973#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3963#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {3973#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3973#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {3973#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3973#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {3983#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {3973#(bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {3983#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {3983#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {3983#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {3983#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {3993#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {3983#(bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {3993#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {3993#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,767 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3775#true} {3993#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} #100#return; {3993#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {3775#true} assume true; {3775#true} is VALID [2022-02-20 23:51:41,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {3775#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3775#true} is VALID [2022-02-20 23:51:41,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {3775#true} ~size := #in~size; {3775#true} is VALID [2022-02-20 23:51:41,767 INFO L272 TraceCheckUtils]: 2: Hoare triple {3993#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {3775#true} is VALID [2022-02-20 23:51:41,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3775#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {3993#(bvslt (_ bv6 32) |ULTIMATE.start_entry_point_~len~0#1|)} is VALID [2022-02-20 23:51:41,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {3775#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3775#true} is VALID [2022-02-20 23:51:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:51:41,769 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:41,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282603103] [2022-02-20 23:51:41,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282603103] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:41,769 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:41,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-02-20 23:51:41,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053155213] [2022-02-20 23:51:41,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:41,770 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-02-20 23:51:41,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:41,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:41,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:41,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:51:41,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:41,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:51:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:51:41,952 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:43,056 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-02-20 23:51:43,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:51:43,057 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-02-20 23:51:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 86 transitions. [2022-02-20 23:51:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 86 transitions. [2022-02-20 23:51:43,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 86 transitions. [2022-02-20 23:51:43,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:43,147 INFO L225 Difference]: With dead ends: 81 [2022-02-20 23:51:43,147 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 23:51:43,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:51:43,148 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:43,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 414 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:51:43,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 23:51:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-02-20 23:51:43,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:43,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:43,151 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:43,151 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:43,153 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-02-20 23:51:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-02-20 23:51:43,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:43,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:43,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 81 states. [2022-02-20 23:51:43,154 INFO L87 Difference]: Start difference. First operand has 81 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 81 states. [2022-02-20 23:51:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:43,155 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2022-02-20 23:51:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-02-20 23:51:43,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:43,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:43,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:43,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:51:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-02-20 23:51:43,157 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 38 [2022-02-20 23:51:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:43,157 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-02-20 23:51:43,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:51:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-02-20 23:51:43,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:51:43,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:43,158 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:43,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:43,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:51:43,367 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:51:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1255484104, now seen corresponding path program 3 times [2022-02-20 23:51:43,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:43,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364798706] [2022-02-20 23:51:43,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:51:43,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:43,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:43,370 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:51:43,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:51:43,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 23:51:43,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:51:43,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:51:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:43,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:43,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:51:44,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {4347#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {4347#true} is VALID [2022-02-20 23:51:44,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {4347#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {4355#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:51:44,299 INFO L272 TraceCheckUtils]: 2: Hoare triple {4355#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {4347#true} is VALID [2022-02-20 23:51:44,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {4347#true} ~size := #in~size; {4362#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:51:44,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {4362#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4366#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {4366#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {4366#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,302 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4366#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {4355#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {4373#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|))} is VALID [2022-02-20 23:51:44,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {4373#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {4377#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {4377#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {4381#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {4381#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4381#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {4381#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4381#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {4381#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4391#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {4391#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4391#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {4391#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4391#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {4391#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4401#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:44,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {4401#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4401#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:44,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {4401#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4401#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} is VALID [2022-02-20 23:51:44,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {4401#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv4294967294 32))))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4411#(and (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {4411#(and (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4411#(and (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {4411#(and (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4411#(and (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {4411#(and (= (bvadd (_ bv4294967293 32) |ULTIMATE.start_entry_point_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4421#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:44,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {4421#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4421#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:44,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {4421#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4421#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} is VALID [2022-02-20 23:51:44,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {4421#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4431#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {4431#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4431#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {4431#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4431#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {4431#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4441#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {4441#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4441#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {4441#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4441#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {4441#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4451#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {4451#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4451#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,316 INFO L290 TraceCheckUtils]: 31: Hoare triple {4451#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4451#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {4451#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (_ bv6 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4461#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {4461#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4461#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {4461#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4461#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:51:44,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {4461#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4471#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:44,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {4471#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4471#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:44,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {4471#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4471#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} is VALID [2022-02-20 23:51:44,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {4471#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_entry_point_~i~1#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4481#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)))} is VALID [2022-02-20 23:51:44,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {4481#(and (= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32)) (= (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4348#false} is VALID [2022-02-20 23:51:44,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {4348#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)))); {4348#false} is VALID [2022-02-20 23:51:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:44,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:51:47,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {4488#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))), #length[entry_point_~array~0#1.base]) && ~bvule32(~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)))); {4348#false} is VALID [2022-02-20 23:51:47,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {4492#(or (not (bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4488#(and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))))} is VALID [2022-02-20 23:51:47,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {4496#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4492#(or (not (bvslt |ULTIMATE.start_entry_point_~i~1#1| |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} is VALID [2022-02-20 23:51:47,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {4496#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4496#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:47,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {4496#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4496#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:48,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {4506#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4496#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv1 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:48,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {4506#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4506#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:48,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {4506#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4506#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:49,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {4516#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4506#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv2 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:49,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {4516#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4516#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:49,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {4516#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4516#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:50,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {4526#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4516#(or (not (bvslt (bvadd (_ bv3 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv12 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:50,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {4526#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4526#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:50,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {4526#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4526#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:51,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {4536#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4526#(or (and (bvule (bvadd (_ bv16 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:51,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {4536#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4536#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:51,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {4536#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4536#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:51,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {4546#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4536#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv20 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv5 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:51,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {4546#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4546#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:51,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {4546#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4546#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:52,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {4556#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4546#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv24 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd (_ bv6 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:52,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {4556#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4556#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:52,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {4556#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4556#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:53,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {4566#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4556#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv28 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv7 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:53,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {4566#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4566#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:53,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {4566#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4566#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:54,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {4576#(or (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4566#(or (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv32 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd (_ bv8 32) |ULTIMATE.start_entry_point_~i~1#1|) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:54,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {4576#(or (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4576#(or (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:54,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {4576#(or (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4576#(or (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:55,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {4586#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {4576#(or (and (bvule (bvadd (_ bv36 32) |ULTIMATE.start_entry_point_~array~0#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))) (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv9 32)) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:55,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {4586#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {4586#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} is VALID [2022-02-20 23:51:55,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {4586#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {4586#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} is VALID [2022-02-20 23:51:55,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {4596#(or (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {4586#(or (not (bvslt (bvadd |ULTIMATE.start_entry_point_~i~1#1| (_ bv10 32)) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|)) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~i~1#1|)))))} is VALID [2022-02-20 23:51:55,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {4600#(or (and (bvule (bvadd (_ bv40 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (bvadd (_ bv44 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|)) (bvule (bvadd (_ bv44 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {4596#(or (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (and (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv40 32)) (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32))) (bvule (bvadd |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv44 32)) (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|))))} is VALID [2022-02-20 23:51:55,549 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4608#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))))} {4604#(or (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (bvule (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} #100#return; {4600#(or (and (bvule (bvadd (_ bv40 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (bvadd (_ bv44 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|)) (bvule (bvadd (_ bv44 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|))) (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:55,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {4608#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))))} assume true; {4608#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))))} is VALID [2022-02-20 23:51:55,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {4615#(or (bvule (_ bv44 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4608#(or (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))) (and (bvule (bvadd |ldv_malloc_#res.offset| (_ bv44 32)) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd |ldv_malloc_#res.offset| (_ bv40 32)) (bvadd |ldv_malloc_#res.offset| (_ bv44 32)))))} is VALID [2022-02-20 23:51:55,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {4347#true} ~size := #in~size; {4615#(or (bvule (_ bv44 32) ldv_malloc_~size) (forall ((|v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15| (_ BitVec 32))) (or (not (bvule (_ bv44 32) (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|))) (not (bvslt (_ bv10 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|)) (not (= (bvmul (_ bv4 32) |v_ULTIMATE.start_entry_point_~len~0#1_BEFORE_CALL_15|) |ldv_malloc_#in~size|)))))} is VALID [2022-02-20 23:51:55,552 INFO L272 TraceCheckUtils]: 2: Hoare triple {4604#(or (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (bvule (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {4347#true} is VALID [2022-02-20 23:51:55,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {4347#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {4604#(or (not (bvslt (_ bv10 32) |ULTIMATE.start_entry_point_~len~0#1|)) (bvule (_ bv44 32) (bvmul (_ bv4 32) |ULTIMATE.start_entry_point_~len~0#1|)))} is VALID [2022-02-20 23:51:55,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {4347#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {4347#true} is VALID [2022-02-20 23:51:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:51:55,553 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:55,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364798706] [2022-02-20 23:51:55,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364798706] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:51:55,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:51:55,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2022-02-20 23:51:55,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466999668] [2022-02-20 23:51:55,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:51:55,555 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-02-20 23:51:55,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:55,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:03,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:03,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-20 23:52:03,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-20 23:52:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 23:52:03,470 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:15,900 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-02-20 23:52:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 23:52:15,900 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-02-20 23:52:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2022-02-20 23:52:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 126 transitions. [2022-02-20 23:52:15,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 126 transitions. [2022-02-20 23:52:16,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:16,401 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:52:16,401 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:52:16,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=301, Invalid=1031, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 23:52:16,402 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 632 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:16,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 489 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 688 Invalid, 0 Unknown, 109 Unchecked, 2.7s Time] [2022-02-20 23:52:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:52:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2022-02-20 23:52:16,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:16,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:16,405 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:16,405 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:16,407 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-02-20 23:52:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2022-02-20 23:52:16,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:16,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:16,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 115 states. [2022-02-20 23:52:16,408 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 115 states. [2022-02-20 23:52:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:16,409 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-02-20 23:52:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2022-02-20 23:52:16,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:16,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:16,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:16,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:52:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-02-20 23:52:16,411 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 41 [2022-02-20 23:52:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:16,411 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-02-20 23:52:16,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-02-20 23:52:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:52:16,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:16,412 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:16,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:16,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:16,620 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 11 more)] === [2022-02-20 23:52:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1908613480, now seen corresponding path program 2 times [2022-02-20 23:52:16,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:16,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399520881] [2022-02-20 23:52:16,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:52:16,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:16,622 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:16,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:52:16,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:52:16,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:52:16,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:52:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:16,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:16,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:16,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:19,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:19,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:52:19,294 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:52:19,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:52:19,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {5052#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5052#true} is VALID [2022-02-20 23:52:19,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {5052#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {5060#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:52:19,365 INFO L272 TraceCheckUtils]: 2: Hoare triple {5060#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {5052#true} is VALID [2022-02-20 23:52:19,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {5052#true} ~size := #in~size; {5067#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:52:19,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {5067#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:19,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:19,367 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {5060#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {5078#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {5078#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:19,382 INFO L290 TraceCheckUtils]: 40: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:19,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} assume !!~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:19,383 INFO L272 TraceCheckUtils]: 42: Hoare triple {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} call alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc(4bv32); {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:52:19,384 INFO L290 TraceCheckUtils]: 43: Hoare triple {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:52:19,385 INFO L290 TraceCheckUtils]: 44: Hoare triple {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:52:19,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:52:19,387 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} #102#return; {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:19,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:19,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} assume !(alloc_17_~p~0#1.base == 0bv32 && alloc_17_~p~0#1.offset == 0bv32); {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:19,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))), #length[alloc_17_~array#1.base]) && ~bvule32(~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)))); {5053#false} is VALID [2022-02-20 23:52:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-20 23:52:19,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:52:19,824 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:19,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399520881] [2022-02-20 23:52:19,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399520881] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:52:19,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092242288] [2022-02-20 23:52:19,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:52:19,825 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:52:19,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:52:19,827 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:52:19,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-02-20 23:52:20,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:52:20,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:52:20,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:52:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:20,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:20,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:20,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:22,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:52:22,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:52:22,573 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:52:22,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:52:22,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {5052#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5052#true} is VALID [2022-02-20 23:52:22,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {5052#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset, entry_point_#t~post43#1, entry_point_#t~ret44#1, entry_point_~i~1#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~1#1;entry_point_~len~0#1 := 10bv32; {5060#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} is VALID [2022-02-20 23:52:22,600 INFO L272 TraceCheckUtils]: 2: Hoare triple {5060#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} call entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset := ldv_malloc(~bvmul32(4bv32, entry_point_~len~0#1)); {5052#true} is VALID [2022-02-20 23:52:22,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {5052#true} ~size := #in~size; {5067#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:52:22,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {5067#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:22,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:22,602 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5071#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {5060#(= |ULTIMATE.start_entry_point_~len~0#1| (_ bv10 32))} #100#return; {5078#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {5078#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv1 1)) (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret42#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret42#1.base|) (_ bv40 32)))} entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset;havoc entry_point_#t~ret42#1.base, entry_point_#t~ret42#1.offset; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume entry_point_~array~0#1.base != 0bv32 || entry_point_~array~0#1.offset != 0bv32;entry_point_~i~1#1 := 0bv32; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !!~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, entry_point_~array~0#1.base, ~bvadd32(entry_point_~array~0#1.offset, ~bvmul32(4bv32, entry_point_~i~1#1)), 4bv32); srcloc: L783 {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} entry_point_#t~post43#1 := entry_point_~i~1#1;entry_point_~i~1#1 := ~bvadd32(1bv32, entry_point_#t~post43#1);havoc entry_point_#t~post43#1; {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume !~bvslt32(entry_point_~i~1#1, entry_point_~len~0#1); {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} is VALID [2022-02-20 23:52:22,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {5082#(and (= (select |#valid| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~array~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_entry_point_~array~0#1.base|) (_ bv40 32)))} assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset, alloc_17_#t~post38#1, alloc_17_#t~mem41#1.base, alloc_17_#t~mem41#1.offset, alloc_17_#t~post40#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0bv32;havoc alloc_17_~j~0#1; {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:22,619 INFO L290 TraceCheckUtils]: 41: Hoare triple {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} assume !!~bvslt32(alloc_17_~i~0#1, alloc_17_~len#1); {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:22,620 INFO L272 TraceCheckUtils]: 42: Hoare triple {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} call alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset := ldv_malloc(4bv32); {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:52:22,620 INFO L290 TraceCheckUtils]: 43: Hoare triple {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:52:22,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {5189#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:52:22,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:52:22,624 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5196#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_269 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_269) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {5182#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= (select |#valid| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} #102#return; {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:22,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset;havoc alloc_17_#t~ret39#1.base, alloc_17_#t~ret39#1.offset; {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:22,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} assume !(alloc_17_~p~0#1.base == 0bv32 && alloc_17_~p~0#1.offset == 0bv32); {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:22,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {5203#(and (= (_ bv0 32) |ULTIMATE.start_alloc_17_~i~0#1|) (= (select |#length| |ULTIMATE.start_alloc_17_~array#1.base|) (_ bv40 32)) (= |ULTIMATE.start_alloc_17_~array#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))), #length[alloc_17_~array#1.base]) && ~bvule32(~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(alloc_17_~array#1.offset, ~bvmul32(4bv32, alloc_17_~i~0#1)))); {5053#false} is VALID [2022-02-20 23:52:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-02-20 23:52:22,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:52:22,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2092242288] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:52:22,950 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:52:22,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2022-02-20 23:52:22,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119363701] [2022-02-20 23:52:22,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:52:22,951 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:52:22,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:22,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:22,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:22,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:52:22,980 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:22,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:52:22,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=128, Unknown=1, NotChecked=0, Total=156 [2022-02-20 23:52:22,981 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:26,640 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-02-20 23:52:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:52:26,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:52:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2022-02-20 23:52:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:52:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2022-02-20 23:52:26,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 165 transitions.