./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 02:49:26,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 02:49:26,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 02:49:26,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 02:49:26,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 02:49:26,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 02:49:26,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 02:49:26,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 02:49:26,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 02:49:26,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 02:49:26,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 02:49:26,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 02:49:26,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 02:49:26,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 02:49:26,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 02:49:26,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 02:49:26,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 02:49:26,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 02:49:26,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 02:49:26,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 02:49:26,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 02:49:26,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 02:49:26,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 02:49:26,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 02:49:26,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 02:49:26,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 02:49:26,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 02:49:26,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 02:49:26,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 02:49:26,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 02:49:26,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 02:49:26,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 02:49:26,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 02:49:26,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 02:49:26,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 02:49:26,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 02:49:26,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 02:49:26,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 02:49:26,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 02:49:26,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 02:49:26,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 02:49:26,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-02-21 02:49:26,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 02:49:26,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 02:49:26,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 02:49:26,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 02:49:26,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 02:49:26,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 02:49:26,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 02:49:26,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 02:49:26,538 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 02:49:26,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 02:49:26,539 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 02:49:26,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 02:49:26,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 02:49:26,540 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 02:49:26,540 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 02:49:26,540 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 02:49:26,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 02:49:26,540 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 02:49:26,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 02:49:26,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 02:49:26,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 02:49:26,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 02:49:26,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:26,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 02:49:26,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 02:49:26,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 02:49:26,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 02:49:26,542 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2022-02-21 02:49:26,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 02:49:26,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 02:49:26,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 02:49:26,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 02:49:26,749 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 02:49:26,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-02-21 02:49:26,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b7b8e22/a0ce3d159fa84676ac0a1fac20c6f248/FLAGa9e82879e [2022-02-21 02:49:27,305 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 02:49:27,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-02-21 02:49:27,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b7b8e22/a0ce3d159fa84676ac0a1fac20c6f248/FLAGa9e82879e [2022-02-21 02:49:27,607 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b7b8e22/a0ce3d159fa84676ac0a1fac20c6f248 [2022-02-21 02:49:27,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 02:49:27,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 02:49:27,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:27,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 02:49:27,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 02:49:27,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:27" (1/1) ... [2022-02-21 02:49:27,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e5889b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:27, skipping insertion in model container [2022-02-21 02:49:27,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:27" (1/1) ... [2022-02-21 02:49:27,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 02:49:27,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:28,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:28,111 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-21 02:49:28,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@48208391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:28, skipping insertion in model container [2022-02-21 02:49:28,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:28,112 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-21 02:49:28,113 INFO L158 Benchmark]: Toolchain (without parser) took 503.19ms. Allocated memory is still 151.0MB. Free memory was 125.1MB in the beginning and 114.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 02:49:28,113 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 02:49:28,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.42ms. Allocated memory is still 151.0MB. Free memory was 124.6MB in the beginning and 115.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 02:49:28,115 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.17ms. Allocated memory is still 92.3MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.42ms. Allocated memory is still 151.0MB. Free memory was 124.6MB in the beginning and 115.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1162]: 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/busybox-1.22.0/dirname-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 02:49:30,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 02:49:30,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 02:49:30,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 02:49:30,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 02:49:30,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 02:49:30,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 02:49:30,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 02:49:30,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 02:49:30,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 02:49:30,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 02:49:30,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 02:49:30,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 02:49:30,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 02:49:30,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 02:49:30,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 02:49:30,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 02:49:30,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 02:49:30,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 02:49:30,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 02:49:30,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 02:49:30,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 02:49:30,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 02:49:30,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 02:49:30,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 02:49:30,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 02:49:30,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 02:49:30,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 02:49:30,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 02:49:30,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 02:49:30,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 02:49:30,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 02:49:30,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 02:49:30,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 02:49:30,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 02:49:30,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 02:49:30,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 02:49:30,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 02:49:30,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 02:49:30,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 02:49:30,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 02:49:30,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-02-21 02:49:30,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 02:49:30,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 02:49:30,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 02:49:30,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 02:49:30,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 02:49:30,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 02:49:30,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 02:49:30,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 02:49:30,132 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 02:49:30,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 02:49:30,133 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 02:49:30,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 02:49:30,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 02:49:30,133 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 02:49:30,134 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 02:49:30,134 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 02:49:30,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 02:49:30,134 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 02:49:30,134 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-21 02:49:30,134 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-21 02:49:30,134 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 02:49:30,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 02:49:30,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 02:49:30,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 02:49:30,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:30,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 02:49:30,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 02:49:30,135 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-21 02:49:30,136 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-21 02:49:30,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-21 02:49:30,136 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90eaf2e76e590922119d90e478fc764e383193134f46d6fe59bc98f3ce7c6611 [2022-02-21 02:49:30,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 02:49:30,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 02:49:30,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 02:49:30,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 02:49:30,433 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 02:49:30,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-02-21 02:49:30,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067f5bf49/82000141f4d94159bc823bbee93577f3/FLAG2b3090161 [2022-02-21 02:49:30,900 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 02:49:30,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2022-02-21 02:49:30,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067f5bf49/82000141f4d94159bc823bbee93577f3/FLAG2b3090161 [2022-02-21 02:49:31,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067f5bf49/82000141f4d94159bc823bbee93577f3 [2022-02-21 02:49:31,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 02:49:31,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 02:49:31,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:31,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 02:49:31,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 02:49:31,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:31,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0294b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31, skipping insertion in model container [2022-02-21 02:49:31,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:31,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 02:49:31,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:31,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:31,752 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-21 02:49:31,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 02:49:31,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:31,845 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 02:49:31,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 02:49:31,955 INFO L208 MainTranslator]: Completed translation [2022-02-21 02:49:31,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31 WrapperNode [2022-02-21 02:49:31,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 02:49:31,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 02:49:31,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 02:49:31,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 02:49:31,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:31,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,041 INFO L137 Inliner]: procedures = 350, calls = 111, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 265 [2022-02-21 02:49:32,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 02:49:32,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 02:49:32,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 02:49:32,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 02:49:32,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 02:49:32,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 02:49:32,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 02:49:32,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 02:49:32,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (1/1) ... [2022-02-21 02:49:32,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 02:49:32,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 02:49:32,118 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-21 02:49:32,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-02-21 02:49:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-21 02:49:32,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-21 02:49:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 02:49:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-02-21 02:49:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 02:49:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-21 02:49:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2022-02-21 02:49:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 02:49:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2022-02-21 02:49:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 02:49:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 02:49:32,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 02:49:32,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 02:49:32,124 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-21 02:49:32,308 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 02:49:32,310 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 02:49:33,063 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 02:49:33,069 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 02:49:33,069 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-21 02:49:33,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 02:49:33 BoogieIcfgContainer [2022-02-21 02:49:33,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 02:49:33,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 02:49:33,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 02:49:33,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 02:49:33,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 02:49:31" (1/3) ... [2022-02-21 02:49:33,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e7578a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 02:49:33, skipping insertion in model container [2022-02-21 02:49:33,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 02:49:31" (2/3) ... [2022-02-21 02:49:33,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e7578a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 02:49:33, skipping insertion in model container [2022-02-21 02:49:33,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 02:49:33" (3/3) ... [2022-02-21 02:49:33,097 INFO L111 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2022-02-21 02:49:33,101 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 02:49:33,101 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2022-02-21 02:49:33,132 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 02:49:33,137 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-21 02:49:33,137 INFO L340 AbstractCegarLoop]: Starting to check reachability of 73 error locations. [2022-02-21 02:49:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 105 states have (on average 1.9428571428571428) internal successors, (204), 178 states have internal predecessors, (204), 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-21 02:49:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 02:49:33,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:33,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 02:49:33,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:49:33,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:33,164 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-21 02:49:33,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:33,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765734424] [2022-02-21 02:49:33,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:33,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:33,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:33,178 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-21 02:49:33,182 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-21 02:49:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:33,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 02:49:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:33,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:33,392 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-21 02:49:33,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {184#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {184#true} is VALID [2022-02-21 02:49:33,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {192#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:49:33,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~a~0#1.base]); {185#false} is VALID [2022-02-21 02:49:33,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-21 02:49:33,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:33,421 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:33,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765734424] [2022-02-21 02:49:33,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765734424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:33,422 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:33,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:33,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857984878] [2022-02-21 02:49:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:33,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:33,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:33,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:33,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:33,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:33,442 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:33,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:33,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:33,466 INFO L87 Difference]: Start difference. First operand has 181 states, 105 states have (on average 1.9428571428571428) internal successors, (204), 178 states have internal predecessors, (204), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:34,230 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2022-02-21 02:49:34,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2022-02-21 02:49:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2022-02-21 02:49:34,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 217 transitions. [2022-02-21 02:49:34,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:34,557 INFO L225 Difference]: With dead ends: 189 [2022-02-21 02:49:34,558 INFO L226 Difference]: Without dead ends: 187 [2022-02-21 02:49:34,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:34,561 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 162 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:34,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 146 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 02:49:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-21 02:49:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 171. [2022-02-21 02:49:34,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:34,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 171 states, 100 states have (on average 1.85) internal successors, (185), 168 states have internal predecessors, (185), 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-21 02:49:34,586 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 171 states, 100 states have (on average 1.85) internal successors, (185), 168 states have internal predecessors, (185), 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-21 02:49:34,587 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 171 states, 100 states have (on average 1.85) internal successors, (185), 168 states have internal predecessors, (185), 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-21 02:49:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:34,593 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-02-21 02:49:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-02-21 02:49:34,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:34,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:34,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 100 states have (on average 1.85) internal successors, (185), 168 states have internal predecessors, (185), 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) Second operand 187 states. [2022-02-21 02:49:34,595 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 1.85) internal successors, (185), 168 states have internal predecessors, (185), 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) Second operand 187 states. [2022-02-21 02:49:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:34,602 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2022-02-21 02:49:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-02-21 02:49:34,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:34,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:34,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:34,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 100 states have (on average 1.85) internal successors, (185), 168 states have internal predecessors, (185), 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-21 02:49:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2022-02-21 02:49:34,609 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 3 [2022-02-21 02:49:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:34,610 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2022-02-21 02:49:34,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2022-02-21 02:49:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-21 02:49:34,610 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:34,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-21 02:49:34,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-21 02:49:34,817 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-21 02:49:34,817 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:49:34,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:34,818 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 02:49:34,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:34,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824407052] [2022-02-21 02:49:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:34,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:34,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:34,821 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-21 02:49:34,822 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-21 02:49:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:34,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:49:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:34,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:34,902 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-21 02:49:34,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {929#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {929#true} is VALID [2022-02-21 02:49:34,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {937#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:34,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {937#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(10bv64, main_~a~0#1.offset)), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(10bv64, main_~a~0#1.offset), ~bvadd64(1bv64, ~bvadd64(10bv64, main_~a~0#1.offset)))) && ~bvule64(0bv64, ~bvadd64(10bv64, main_~a~0#1.offset))); {930#false} is VALID [2022-02-21 02:49:34,913 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-21 02:49:34,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:34,914 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:34,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824407052] [2022-02-21 02:49:34,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824407052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:34,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:34,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:34,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806002421] [2022-02-21 02:49:34,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:34,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:34,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:34,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:34,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:34,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:34,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:34,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:34,925 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:36,144 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2022-02-21 02:49:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-21 02:49:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2022-02-21 02:49:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2022-02-21 02:49:36,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 187 transitions. [2022-02-21 02:49:36,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:36,324 INFO L225 Difference]: With dead ends: 170 [2022-02-21 02:49:36,325 INFO L226 Difference]: Without dead ends: 170 [2022-02-21 02:49:36,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:36,325 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 9 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:36,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 292 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:49:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-21 02:49:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-02-21 02:49:36,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:36,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 170 states, 100 states have (on average 1.84) internal successors, (184), 167 states have internal predecessors, (184), 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-21 02:49:36,335 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 170 states, 100 states have (on average 1.84) internal successors, (184), 167 states have internal predecessors, (184), 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-21 02:49:36,335 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 170 states, 100 states have (on average 1.84) internal successors, (184), 167 states have internal predecessors, (184), 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-21 02:49:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:36,340 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2022-02-21 02:49:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2022-02-21 02:49:36,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:36,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:36,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 100 states have (on average 1.84) internal successors, (184), 167 states have internal predecessors, (184), 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) Second operand 170 states. [2022-02-21 02:49:36,345 INFO L87 Difference]: Start difference. First operand has 170 states, 100 states have (on average 1.84) internal successors, (184), 167 states have internal predecessors, (184), 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) Second operand 170 states. [2022-02-21 02:49:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:36,352 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2022-02-21 02:49:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2022-02-21 02:49:36,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:36,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:36,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:36,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 100 states have (on average 1.84) internal successors, (184), 167 states have internal predecessors, (184), 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-21 02:49:36,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2022-02-21 02:49:36,365 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 3 [2022-02-21 02:49:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:36,366 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2022-02-21 02:49:36,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2022-02-21 02:49:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 02:49:36,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:36,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 02:49:36,386 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-21 02:49:36,573 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-21 02:49:36,574 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:49:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-02-21 02:49:36,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:36,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316786619] [2022-02-21 02:49:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:36,577 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-21 02:49:36,578 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-21 02:49:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:36,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:36,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:36,658 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-21 02:49:36,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {1620#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {1620#true} is VALID [2022-02-21 02:49:36,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {1620#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {1628#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:36,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {1628#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {1628#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:36,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {1628#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} main_~i~4#1 := 0bv32; {1635#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:36,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {1635#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} assume !!~bvslt32(main_~i~4#1, 10bv32); {1635#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:36,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {1635#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1))), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), ~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1))))) && ~bvule64(0bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)))); {1621#false} is VALID [2022-02-21 02:49:36,716 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-21 02:49:36,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:36,716 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:36,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316786619] [2022-02-21 02:49:36,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316786619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:36,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:36,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 02:49:36,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734600582] [2022-02-21 02:49:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:36,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 02:49:36,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:36,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:36,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:36,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 02:49:36,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 02:49:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:49:36,736 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:37,909 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-21 02:49:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 02:49:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 02:49:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-02-21 02:49:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-02-21 02:49:37,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-02-21 02:49:38,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:38,119 INFO L225 Difference]: With dead ends: 174 [2022-02-21 02:49:38,119 INFO L226 Difference]: Without dead ends: 174 [2022-02-21 02:49:38,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:49:38,120 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:38,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 291 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:49:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-21 02:49:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-02-21 02:49:38,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:38,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 172 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 169 states have internal predecessors, (186), 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-21 02:49:38,126 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 172 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 169 states have internal predecessors, (186), 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-21 02:49:38,126 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 172 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 169 states have internal predecessors, (186), 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-21 02:49:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:38,132 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-21 02:49:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2022-02-21 02:49:38,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:38,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:38,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 169 states have internal predecessors, (186), 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) Second operand 174 states. [2022-02-21 02:49:38,133 INFO L87 Difference]: Start difference. First operand has 172 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 169 states have internal predecessors, (186), 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) Second operand 174 states. [2022-02-21 02:49:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:38,139 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2022-02-21 02:49:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2022-02-21 02:49:38,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:38,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:38,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:38,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 102 states have (on average 1.8235294117647058) internal successors, (186), 169 states have internal predecessors, (186), 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-21 02:49:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 188 transitions. [2022-02-21 02:49:38,146 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 188 transitions. Word has length 6 [2022-02-21 02:49:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:38,146 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 188 transitions. [2022-02-21 02:49:38,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 188 transitions. [2022-02-21 02:49:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 02:49:38,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:38,147 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:38,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-21 02:49:38,354 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-21 02:49:38,355 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:49:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2022-02-21 02:49:38,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:38,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427200133] [2022-02-21 02:49:38,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:38,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:38,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:38,357 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-21 02:49:38,359 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-21 02:49:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:38,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 02:49:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:38,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:38,440 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-21 02:49:38,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {2335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {2335#true} is VALID [2022-02-21 02:49:38,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {2335#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {2343#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {2343#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {2343#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {2343#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} main_~i~4#1 := 0bv32; {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} assume !!~bvslt32(main_~i~4#1, 10bv32); {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} havoc main_#t~nondet136#1; {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {2350#(and (= |ULTIMATE.start_main_~i~4#1| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {2363#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {2363#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} assume !!~bvslt32(main_~i~4#1, 10bv32); {2363#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} is VALID [2022-02-21 02:49:38,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {2363#(and (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) (_ bv11 64)) (= |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~a~0#1.offset|))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1))), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), ~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1))))) && ~bvule64(0bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)))); {2336#false} is VALID [2022-02-21 02:49:38,548 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-21 02:49:38,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:39,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {2370#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !((~bvule64(~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1))), #length[main_~a~0#1.base]) && ~bvule64(~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), ~bvadd64(1bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1))))) && ~bvule64(0bv64, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)))); {2336#false} is VALID [2022-02-21 02:49:39,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {2370#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!~bvslt32(main_~i~4#1, 10bv32); {2370#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:39,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {2370#(and (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)) (bvule (bvadd ((_ sign_extend 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-21 02:49:39,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} havoc main_#t~nondet136#1; {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:39,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:39,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} assume !!~bvslt32(main_~i~4#1, 10bv32); {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:39,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {2390#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} main_~i~4#1 := 0bv32; {2377#(and (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32))) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:39,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {2390#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {2390#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:39,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {2335#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {2390#(and (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) |ULTIMATE.start_main_~a~0#1.offset|) (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) |ULTIMATE.start_main_~a~0#1.offset|)))} is VALID [2022-02-21 02:49:39,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {2335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {2335#true} is VALID [2022-02-21 02:49:39,545 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-21 02:49:39,545 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:39,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427200133] [2022-02-21 02:49:39,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427200133] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:39,545 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:39,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-21 02:49:39,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385428380] [2022-02-21 02:49:39,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 02:49:39,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:39,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:39,584 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-21 02:49:39,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 02:49:39,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:39,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 02:49:39,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 02:49:39,585 INFO L87 Difference]: Start difference. First operand 172 states and 188 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:50,232 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2022-02-21 02:49:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 02:49:50,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 02:49:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2022-02-21 02:49:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2022-02-21 02:49:50,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 198 transitions. [2022-02-21 02:49:50,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:50,454 INFO L225 Difference]: With dead ends: 178 [2022-02-21 02:49:50,454 INFO L226 Difference]: Without dead ends: 178 [2022-02-21 02:49:50,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-21 02:49:50,455 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 30 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:50,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 736 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-02-21 02:49:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-21 02:49:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-02-21 02:49:50,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:50,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 178 states, 109 states have (on average 1.761467889908257) internal successors, (192), 175 states have internal predecessors, (192), 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-21 02:49:50,460 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 178 states, 109 states have (on average 1.761467889908257) internal successors, (192), 175 states have internal predecessors, (192), 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-21 02:49:50,460 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 178 states, 109 states have (on average 1.761467889908257) internal successors, (192), 175 states have internal predecessors, (192), 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-21 02:49:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:50,469 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2022-02-21 02:49:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2022-02-21 02:49:50,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:50,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:50,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 109 states have (on average 1.761467889908257) internal successors, (192), 175 states have internal predecessors, (192), 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) Second operand 178 states. [2022-02-21 02:49:50,479 INFO L87 Difference]: Start difference. First operand has 178 states, 109 states have (on average 1.761467889908257) internal successors, (192), 175 states have internal predecessors, (192), 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) Second operand 178 states. [2022-02-21 02:49:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:50,483 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2022-02-21 02:49:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2022-02-21 02:49:50,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:50,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:50,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:50,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 109 states have (on average 1.761467889908257) internal successors, (192), 175 states have internal predecessors, (192), 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-21 02:49:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions. [2022-02-21 02:49:50,496 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 10 [2022-02-21 02:49:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:50,496 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions. [2022-02-21 02:49:50,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 02:49:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2022-02-21 02:49:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 02:49:50,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:50,497 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:50,505 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-21 02:49:50,704 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-21 02:49:50,705 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:49:50,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2007736717, now seen corresponding path program 1 times [2022-02-21 02:49:50,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:50,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836529497] [2022-02-21 02:49:50,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:50,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:50,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:50,709 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-21 02:49:50,710 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-21 02:49:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:50,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:49:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:50,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:50,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {3115#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3115#true} is VALID [2022-02-21 02:49:50,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {3115#true} is VALID [2022-02-21 02:49:50,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {3115#true} is VALID [2022-02-21 02:49:50,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {3115#true} main_~i~4#1 := 0bv32; {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:50,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:50,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:50,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} havoc main_#t~nondet136#1; {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:50,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:50,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:50,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:50,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} havoc main_#t~nondet136#1; {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:50,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {3142#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} is VALID [2022-02-21 02:49:50,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} is VALID [2022-02-21 02:49:50,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} is VALID [2022-02-21 02:49:50,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} havoc main_#t~nondet136#1; {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} is VALID [2022-02-21 02:49:50,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {3155#(= |ULTIMATE.start_main_~i~4#1| (_ bv2 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {3168#(= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} is VALID [2022-02-21 02:49:50,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {3168#(= (_ bv2 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} assume !~bvslt32(main_~i~4#1, 10bv32); {3116#false} is VALID [2022-02-21 02:49:50,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {3116#false} is VALID [2022-02-21 02:49:50,953 INFO L272 TraceCheckUtils]: 18: Hoare triple {3116#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {3116#false} is VALID [2022-02-21 02:49:50,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-02-21 02:49:50,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} assume !(0bv32 == ~cond); {3116#false} is VALID [2022-02-21 02:49:50,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume true; {3116#false} is VALID [2022-02-21 02:49:50,953 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3116#false} {3116#false} #320#return; {3116#false} is VALID [2022-02-21 02:49:50,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {3116#false} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {3116#false} is VALID [2022-02-21 02:49:50,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {3116#false} assume !(1bv1 == #valid[main_~argv~0#1.base]); {3116#false} is VALID [2022-02-21 02:49:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:50,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:51,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {3116#false} assume !(1bv1 == #valid[main_~argv~0#1.base]); {3116#false} is VALID [2022-02-21 02:49:51,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {3116#false} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {3116#false} is VALID [2022-02-21 02:49:51,066 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3115#true} {3116#false} #320#return; {3116#false} is VALID [2022-02-21 02:49:51,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-02-21 02:49:51,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {3115#true} assume !(0bv32 == ~cond); {3115#true} is VALID [2022-02-21 02:49:51,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {3115#true} ~cond := #in~cond; {3115#true} is VALID [2022-02-21 02:49:51,066 INFO L272 TraceCheckUtils]: 18: Hoare triple {3116#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {3115#true} is VALID [2022-02-21 02:49:51,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {3116#false} is VALID [2022-02-21 02:49:51,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {3220#(bvslt |ULTIMATE.start_main_~i~4#1| (_ bv10 32))} assume !~bvslt32(main_~i~4#1, 10bv32); {3116#false} is VALID [2022-02-21 02:49:51,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {3220#(bvslt |ULTIMATE.start_main_~i~4#1| (_ bv10 32))} is VALID [2022-02-21 02:49:51,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {3224#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {3237#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,075 INFO L290 TraceCheckUtils]: 4: Hoare triple {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {3115#true} main_~i~4#1 := 0bv32; {3250#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:51,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {3115#true} is VALID [2022-02-21 02:49:51,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {3115#true} is VALID [2022-02-21 02:49:51,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {3115#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {3115#true} is VALID [2022-02-21 02:49:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:51,076 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:51,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836529497] [2022-02-21 02:49:51,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836529497] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:51,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:51,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-02-21 02:49:51,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808275860] [2022-02-21 02:49:51,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:51,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-21 02:49:51,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:51,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:51,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:51,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 02:49:51,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:51,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 02:49:51,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-21 02:49:51,127 INFO L87 Difference]: Start difference. First operand 178 states and 194 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:53,427 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2022-02-21 02:49:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 02:49:53,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-21 02:49:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2022-02-21 02:49:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2022-02-21 02:49:53,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 219 transitions. [2022-02-21 02:49:53,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:53,689 INFO L225 Difference]: With dead ends: 198 [2022-02-21 02:49:53,690 INFO L226 Difference]: Without dead ends: 198 [2022-02-21 02:49:53,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-02-21 02:49:53,690 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 27 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:53,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 912 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 02:49:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-21 02:49:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-02-21 02:49:53,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:53,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 198 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 195 states have internal predecessors, (212), 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-21 02:49:53,695 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 198 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 195 states have internal predecessors, (212), 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-21 02:49:53,696 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 198 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 195 states have internal predecessors, (212), 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-21 02:49:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:53,699 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2022-02-21 02:49:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2022-02-21 02:49:53,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:53,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:53,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 195 states have internal predecessors, (212), 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) Second operand 198 states. [2022-02-21 02:49:53,700 INFO L87 Difference]: Start difference. First operand has 198 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 195 states have internal predecessors, (212), 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) Second operand 198 states. [2022-02-21 02:49:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:53,703 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2022-02-21 02:49:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2022-02-21 02:49:53,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:53,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:53,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:53,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 195 states have internal predecessors, (212), 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-21 02:49:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2022-02-21 02:49:53,708 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 25 [2022-02-21 02:49:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:53,708 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2022-02-21 02:49:53,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2022-02-21 02:49:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 02:49:53,709 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:53,709 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:53,717 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-21 02:49:53,917 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-21 02:49:53,918 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:49:53,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:53,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1499348962, now seen corresponding path program 2 times [2022-02-21 02:49:53,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:53,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147593369] [2022-02-21 02:49:53,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 02:49:53,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:53,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:53,927 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-21 02:49:53,928 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-21 02:49:54,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 02:49:54,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 02:49:54,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:49:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:54,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:54,174 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 02:49:54,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-21 02:49:54,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {4069#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {4069#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {4069#true} main_~i~4#1 := 0bv32; {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {4069#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {4069#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {4069#true} is VALID [2022-02-21 02:49:54,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {4069#true} havoc main_#t~nondet136#1; {4069#true} is VALID [2022-02-21 02:49:54,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {4069#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {4069#true} is VALID [2022-02-21 02:49:54,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {4069#true} assume !~bvslt32(main_~i~4#1, 10bv32); {4069#true} is VALID [2022-02-21 02:49:54,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {4069#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {4069#true} is VALID [2022-02-21 02:49:54,226 INFO L272 TraceCheckUtils]: 38: Hoare triple {4069#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {4069#true} is VALID [2022-02-21 02:49:54,226 INFO L290 TraceCheckUtils]: 39: Hoare triple {4069#true} ~cond := #in~cond; {4069#true} is VALID [2022-02-21 02:49:54,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {4069#true} assume !(0bv32 == ~cond); {4069#true} is VALID [2022-02-21 02:49:54,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {4069#true} assume true; {4069#true} is VALID [2022-02-21 02:49:54,227 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4069#true} {4069#true} #320#return; {4069#true} is VALID [2022-02-21 02:49:54,229 INFO L290 TraceCheckUtils]: 43: Hoare triple {4069#true} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {4203#(= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|))) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-21 02:49:54,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {4203#(= (bvadd (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|))) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[main_~argv~0#1.base]); {4070#false} is VALID [2022-02-21 02:49:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-02-21 02:49:54,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:49:54,230 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:54,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147593369] [2022-02-21 02:49:54,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147593369] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:49:54,230 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:49:54,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:49:54,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509765523] [2022-02-21 02:49:54,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:49:54,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2022-02-21 02:49:54,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:54,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-21 02:49:54,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:54,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:49:54,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:54,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:49:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:54,266 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-21 02:49:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:55,046 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2022-02-21 02:49:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:49:55,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2022-02-21 02:49:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:49:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-21 02:49:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-02-21 02:49:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-21 02:49:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-02-21 02:49:55,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2022-02-21 02:49:55,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:55,317 INFO L225 Difference]: With dead ends: 209 [2022-02-21 02:49:55,317 INFO L226 Difference]: Without dead ends: 209 [2022-02-21 02:49:55,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:49:55,317 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 147 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:49:55,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 149 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:49:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-21 02:49:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 193. [2022-02-21 02:49:55,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:49:55,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 193 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 190 states have internal predecessors, (207), 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-21 02:49:55,331 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 193 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 190 states have internal predecessors, (207), 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-21 02:49:55,331 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 193 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 190 states have internal predecessors, (207), 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-21 02:49:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:55,335 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2022-02-21 02:49:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2022-02-21 02:49:55,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:55,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:55,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 190 states have internal predecessors, (207), 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) Second operand 209 states. [2022-02-21 02:49:55,336 INFO L87 Difference]: Start difference. First operand has 193 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 190 states have internal predecessors, (207), 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) Second operand 209 states. [2022-02-21 02:49:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:49:55,353 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2022-02-21 02:49:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2022-02-21 02:49:55,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:49:55,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:49:55,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:49:55,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:49:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 190 states have internal predecessors, (207), 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-21 02:49:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2022-02-21 02:49:55,357 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 45 [2022-02-21 02:49:55,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:49:55,357 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2022-02-21 02:49:55,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-21 02:49:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2022-02-21 02:49:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 02:49:55,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:49:55,358 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:49:55,375 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-21 02:49:55,565 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-21 02:49:55,565 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:49:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:49:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1499348961, now seen corresponding path program 1 times [2022-02-21 02:49:55,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:49:55,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733811041] [2022-02-21 02:49:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:49:55,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:49:55,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:49:55,567 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-21 02:49:55,571 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-21 02:49:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:55,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 02:49:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:49:55,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:49:55,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {5026#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {5026#true} is VALID [2022-02-21 02:49:55,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {5026#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {5026#true} is VALID [2022-02-21 02:49:55,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {5026#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {5026#true} is VALID [2022-02-21 02:49:55,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {5026#true} main_~i~4#1 := 0bv32; {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:55,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:55,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:55,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} havoc main_#t~nondet136#1; {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} is VALID [2022-02-21 02:49:55,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {5040#(= |ULTIMATE.start_main_~i~4#1| (_ bv0 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:55,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:55,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:55,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} havoc main_#t~nondet136#1; {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} is VALID [2022-02-21 02:49:55,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {5053#(= |ULTIMATE.start_main_~i~4#1| (_ bv1 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} is VALID [2022-02-21 02:49:55,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} is VALID [2022-02-21 02:49:55,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} is VALID [2022-02-21 02:49:55,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} havoc main_#t~nondet136#1; {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} is VALID [2022-02-21 02:49:55,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {5066#(= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|) (_ bv1 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} is VALID [2022-02-21 02:49:55,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} is VALID [2022-02-21 02:49:55,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} is VALID [2022-02-21 02:49:55,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} havoc main_#t~nondet136#1; {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} is VALID [2022-02-21 02:49:55,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {5079#(= |ULTIMATE.start_main_~i~4#1| (_ bv3 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} is VALID [2022-02-21 02:49:55,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} assume !!~bvslt32(main_~i~4#1, 10bv32); {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} is VALID [2022-02-21 02:49:55,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} is VALID [2022-02-21 02:49:55,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} havoc main_#t~nondet136#1; {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} is VALID [2022-02-21 02:49:55,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {5092#(= (_ bv4 32) |ULTIMATE.start_main_~i~4#1|)} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} is VALID [2022-02-21 02:49:55,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} is VALID [2022-02-21 02:49:55,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} is VALID [2022-02-21 02:49:55,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} havoc main_#t~nondet136#1; {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} is VALID [2022-02-21 02:49:55,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {5105#(= (_ bv4 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~4#1|))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} is VALID [2022-02-21 02:49:55,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} is VALID [2022-02-21 02:49:55,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} is VALID [2022-02-21 02:49:55,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} havoc main_#t~nondet136#1; {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} is VALID [2022-02-21 02:49:55,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {5118#(= |ULTIMATE.start_main_~i~4#1| (_ bv6 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} is VALID [2022-02-21 02:49:55,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} is VALID [2022-02-21 02:49:55,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} is VALID [2022-02-21 02:49:55,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} havoc main_#t~nondet136#1; {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} is VALID [2022-02-21 02:49:55,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {5131#(= |ULTIMATE.start_main_~i~4#1| (_ bv7 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5144#(= |ULTIMATE.start_main_~i~4#1| (_ bv8 32))} is VALID [2022-02-21 02:49:55,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {5144#(= |ULTIMATE.start_main_~i~4#1| (_ bv8 32))} assume !~bvslt32(main_~i~4#1, 10bv32); {5027#false} is VALID [2022-02-21 02:49:55,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {5027#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {5027#false} is VALID [2022-02-21 02:49:55,922 INFO L272 TraceCheckUtils]: 38: Hoare triple {5027#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {5027#false} is VALID [2022-02-21 02:49:55,922 INFO L290 TraceCheckUtils]: 39: Hoare triple {5027#false} ~cond := #in~cond; {5027#false} is VALID [2022-02-21 02:49:55,922 INFO L290 TraceCheckUtils]: 40: Hoare triple {5027#false} assume !(0bv32 == ~cond); {5027#false} is VALID [2022-02-21 02:49:55,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {5027#false} assume true; {5027#false} is VALID [2022-02-21 02:49:55,922 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5027#false} {5027#false} #320#return; {5027#false} is VALID [2022-02-21 02:49:55,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {5027#false} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {5027#false} is VALID [2022-02-21 02:49:55,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {5027#false} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))))); {5027#false} is VALID [2022-02-21 02:49:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:55,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 02:49:56,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {5027#false} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))))); {5027#false} is VALID [2022-02-21 02:49:56,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {5027#false} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {5027#false} is VALID [2022-02-21 02:49:56,203 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5026#true} {5027#false} #320#return; {5027#false} is VALID [2022-02-21 02:49:56,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {5026#true} assume true; {5026#true} is VALID [2022-02-21 02:49:56,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {5026#true} assume !(0bv32 == ~cond); {5026#true} is VALID [2022-02-21 02:49:56,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {5026#true} ~cond := #in~cond; {5026#true} is VALID [2022-02-21 02:49:56,203 INFO L272 TraceCheckUtils]: 38: Hoare triple {5027#false} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {5026#true} is VALID [2022-02-21 02:49:56,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {5027#false} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {5027#false} is VALID [2022-02-21 02:49:56,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {5196#(bvslt |ULTIMATE.start_main_~i~4#1| (_ bv10 32))} assume !~bvslt32(main_~i~4#1, 10bv32); {5027#false} is VALID [2022-02-21 02:49:56,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5196#(bvslt |ULTIMATE.start_main_~i~4#1| (_ bv10 32))} is VALID [2022-02-21 02:49:56,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5200#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5213#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv2 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5226#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv3 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} havoc main_#t~nondet136#1; {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:56,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:56,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:56,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5239#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~i~4#1|) (_ bv10 32))} is VALID [2022-02-21 02:49:56,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5252#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv5 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5265#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv6 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {5278#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv7 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} havoc main_#t~nondet136#1; {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} assume !!~bvslt32(main_~i~4#1, 10bv32); {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {5026#true} main_~i~4#1 := 0bv32; {5291#(bvslt (bvadd |ULTIMATE.start_main_~i~4#1| (_ bv8 32)) (_ bv10 32))} is VALID [2022-02-21 02:49:56,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {5026#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {5026#true} is VALID [2022-02-21 02:49:56,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {5026#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {5026#true} is VALID [2022-02-21 02:49:56,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {5026#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {5026#true} is VALID [2022-02-21 02:49:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 02:49:56,230 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:49:56,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733811041] [2022-02-21 02:49:56,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733811041] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 02:49:56,230 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 02:49:56,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-02-21 02:49:56,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271605341] [2022-02-21 02:49:56,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 02:49:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-21 02:49:56,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:49:56,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:49:56,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:49:56,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-21 02:49:56,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:49:56,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 02:49:56,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-02-21 02:49:56,350 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:50:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:01,791 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2022-02-21 02:50:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 02:50:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-02-21 02:50:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:50:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2022-02-21 02:50:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:50:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 219 transitions. [2022-02-21 02:50:01,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 219 transitions. [2022-02-21 02:50:02,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:02,075 INFO L225 Difference]: With dead ends: 201 [2022-02-21 02:50:02,075 INFO L226 Difference]: Without dead ends: 201 [2022-02-21 02:50:02,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-02-21 02:50:02,076 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 33 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1812 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 1812 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-21 02:50:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-21 02:50:02,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-02-21 02:50:02,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:02,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 201 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 198 states have internal predecessors, (215), 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-21 02:50:02,080 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 201 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 198 states have internal predecessors, (215), 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-21 02:50:02,080 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 201 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 198 states have internal predecessors, (215), 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-21 02:50:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:02,083 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2022-02-21 02:50:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2022-02-21 02:50:02,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:02,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:02,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 198 states have internal predecessors, (215), 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) Second operand 201 states. [2022-02-21 02:50:02,084 INFO L87 Difference]: Start difference. First operand has 201 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 198 states have internal predecessors, (215), 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) Second operand 201 states. [2022-02-21 02:50:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:02,103 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2022-02-21 02:50:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2022-02-21 02:50:02,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:02,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:02,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:02,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 198 states have internal predecessors, (215), 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-21 02:50:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 217 transitions. [2022-02-21 02:50:02,107 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 217 transitions. Word has length 45 [2022-02-21 02:50:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:02,108 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 217 transitions. [2022-02-21 02:50:02,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 02:50:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 217 transitions. [2022-02-21 02:50:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 02:50:02,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:02,109 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:02,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-21 02:50:02,318 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-21 02:50:02,319 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash 621817561, now seen corresponding path program 2 times [2022-02-21 02:50:02,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:02,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208715786] [2022-02-21 02:50:02,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 02:50:02,320 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:02,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:02,321 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-21 02:50:02,323 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-21 02:50:02,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 02:50:02,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 02:50:02,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 02:50:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:02,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:02,646 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-02-21 02:50:02,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-02-21 02:50:02,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {6116#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {6116#true} is VALID [2022-02-21 02:50:02,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {6116#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {6116#true} is VALID [2022-02-21 02:50:02,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {6116#true} is VALID [2022-02-21 02:50:02,693 INFO L290 TraceCheckUtils]: 3: Hoare triple {6116#true} main_~i~4#1 := 0bv32; {6116#true} is VALID [2022-02-21 02:50:02,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {6116#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {6116#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {6116#true} havoc main_#t~nondet136#1; {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 43: Hoare triple {6116#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 44: Hoare triple {6116#true} assume !~bvslt32(main_~i~4#1, 10bv32); {6116#true} is VALID [2022-02-21 02:50:02,711 INFO L290 TraceCheckUtils]: 45: Hoare triple {6116#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {6116#true} is VALID [2022-02-21 02:50:02,712 INFO L272 TraceCheckUtils]: 46: Hoare triple {6116#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {6116#true} is VALID [2022-02-21 02:50:02,712 INFO L290 TraceCheckUtils]: 47: Hoare triple {6116#true} ~cond := #in~cond; {6262#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:02,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {6262#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {6266#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:02,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {6266#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {6266#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:02,714 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6266#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {6116#true} #320#return; {6273#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:02,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {6273#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {6277#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))} is VALID [2022-02-21 02:50:02,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {6277#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))))); {6117#false} is VALID [2022-02-21 02:50:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:02,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:02,723 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:02,725 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208715786] [2022-02-21 02:50:02,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208715786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:02,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:02,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 02:50:02,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950512722] [2022-02-21 02:50:02,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:02,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2022-02-21 02:50:02,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:02,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-21 02:50:02,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:02,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 02:50:02,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:02,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 02:50:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 02:50:02,758 INFO L87 Difference]: Start difference. First operand 201 states and 217 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-21 02:50:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:06,383 INFO L93 Difference]: Finished difference Result 321 states and 351 transitions. [2022-02-21 02:50:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 02:50:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2022-02-21 02:50:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-21 02:50:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 316 transitions. [2022-02-21 02:50:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-21 02:50:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 316 transitions. [2022-02-21 02:50:06,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 316 transitions. [2022-02-21 02:50:06,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:06,885 INFO L225 Difference]: With dead ends: 321 [2022-02-21 02:50:06,885 INFO L226 Difference]: Without dead ends: 321 [2022-02-21 02:50:06,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 02:50:06,886 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 436 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:06,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 484 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-21 02:50:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-02-21 02:50:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 265. [2022-02-21 02:50:06,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:06,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 265 states, 202 states have (on average 1.6732673267326732) internal successors, (338), 262 states have internal predecessors, (338), 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-21 02:50:06,890 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 265 states, 202 states have (on average 1.6732673267326732) internal successors, (338), 262 states have internal predecessors, (338), 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-21 02:50:06,890 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 265 states, 202 states have (on average 1.6732673267326732) internal successors, (338), 262 states have internal predecessors, (338), 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-21 02:50:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:06,895 INFO L93 Difference]: Finished difference Result 321 states and 351 transitions. [2022-02-21 02:50:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 351 transitions. [2022-02-21 02:50:06,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:06,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:06,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 202 states have (on average 1.6732673267326732) internal successors, (338), 262 states have internal predecessors, (338), 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) Second operand 321 states. [2022-02-21 02:50:06,903 INFO L87 Difference]: Start difference. First operand has 265 states, 202 states have (on average 1.6732673267326732) internal successors, (338), 262 states have internal predecessors, (338), 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) Second operand 321 states. [2022-02-21 02:50:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:06,908 INFO L93 Difference]: Finished difference Result 321 states and 351 transitions. [2022-02-21 02:50:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 351 transitions. [2022-02-21 02:50:06,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:06,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:06,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:06,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 202 states have (on average 1.6732673267326732) internal successors, (338), 262 states have internal predecessors, (338), 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-21 02:50:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 340 transitions. [2022-02-21 02:50:06,913 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 340 transitions. Word has length 53 [2022-02-21 02:50:06,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:06,913 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 340 transitions. [2022-02-21 02:50:06,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-21 02:50:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 340 transitions. [2022-02-21 02:50:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 02:50:06,914 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:06,914 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:06,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-21 02:50:07,123 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-21 02:50:07,123 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:07,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash 372982570, now seen corresponding path program 1 times [2022-02-21 02:50:07,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:07,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932759326] [2022-02-21 02:50:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:07,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:07,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:07,125 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-21 02:50:07,139 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-21 02:50:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:07,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 02:50:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:07,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:07,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 02:50:07,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 02:50:07,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-02-21 02:50:07,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 02:50:07,811 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 17 treesize of output 19 [2022-02-21 02:50:07,822 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 02:50:07,822 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 11 treesize of output 11 [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {7510#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {7510#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {7510#true} main_~i~4#1 := 0bv32; {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {7510#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {7510#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {7510#true} is VALID [2022-02-21 02:50:07,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {7510#true} havoc main_#t~nondet136#1; {7510#true} is VALID [2022-02-21 02:50:07,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {7510#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {7510#true} is VALID [2022-02-21 02:50:07,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {7510#true} assume !~bvslt32(main_~i~4#1, 10bv32); {7510#true} is VALID [2022-02-21 02:50:07,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {7510#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {7510#true} is VALID [2022-02-21 02:50:07,900 INFO L272 TraceCheckUtils]: 46: Hoare triple {7510#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {7510#true} is VALID [2022-02-21 02:50:07,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {7510#true} ~cond := #in~cond; {7656#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:07,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {7656#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {7660#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:07,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {7660#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {7660#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:07,901 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7660#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {7510#true} #320#return; {7667#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:07,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {7667#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {7671#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))))} is VALID [2022-02-21 02:50:07,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {7671#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1334 {7675#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} is VALID [2022-02-21 02:50:07,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {7675#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} main_~i~5#1 := 0bv32; {7679#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} is VALID [2022-02-21 02:50:07,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {7679#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1)))} assume !!~bvslt32(main_~i~5#1, main_~argc~0#1);call main_#t~malloc142#1.base, main_#t~malloc142#1.offset := #Ultimate.allocOnHeap(11bv64); {7683#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:07,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {7683#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= (select |#length| |ULTIMATE.start_main_~argv~0#1.base|) (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32))))))) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))))); {7511#false} is VALID [2022-02-21 02:50:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:07,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:07,911 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:07,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932759326] [2022-02-21 02:50:07,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932759326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:07,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:07,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 02:50:07,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711580547] [2022-02-21 02:50:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2022-02-21 02:50:07,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:07,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-21 02:50:07,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:07,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 02:50:07,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 02:50:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-21 02:50:07,966 INFO L87 Difference]: Start difference. First operand 265 states and 340 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-21 02:50:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:09,879 INFO L93 Difference]: Finished difference Result 266 states and 341 transitions. [2022-02-21 02:50:09,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 02:50:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2022-02-21 02:50:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-21 02:50:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2022-02-21 02:50:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-21 02:50:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions. [2022-02-21 02:50:09,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 183 transitions. [2022-02-21 02:50:10,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:10,222 INFO L225 Difference]: With dead ends: 266 [2022-02-21 02:50:10,222 INFO L226 Difference]: Without dead ends: 266 [2022-02-21 02:50:10,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-21 02:50:10,222 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 4 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:10,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 971 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 167 Unchecked, 0.0s Time] [2022-02-21 02:50:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-02-21 02:50:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-02-21 02:50:10,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:10,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 266 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 263 states have internal predecessors, (339), 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-21 02:50:10,227 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 266 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 263 states have internal predecessors, (339), 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-21 02:50:10,227 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 266 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 263 states have internal predecessors, (339), 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-21 02:50:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:10,232 INFO L93 Difference]: Finished difference Result 266 states and 341 transitions. [2022-02-21 02:50:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 341 transitions. [2022-02-21 02:50:10,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:10,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:10,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 263 states have internal predecessors, (339), 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) Second operand 266 states. [2022-02-21 02:50:10,233 INFO L87 Difference]: Start difference. First operand has 266 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 263 states have internal predecessors, (339), 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) Second operand 266 states. [2022-02-21 02:50:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:10,237 INFO L93 Difference]: Finished difference Result 266 states and 341 transitions. [2022-02-21 02:50:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 341 transitions. [2022-02-21 02:50:10,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:10,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:10,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:10,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:10,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 203 states have (on average 1.6699507389162562) internal successors, (339), 263 states have internal predecessors, (339), 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-21 02:50:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 341 transitions. [2022-02-21 02:50:10,242 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 341 transitions. Word has length 56 [2022-02-21 02:50:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:10,242 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 341 transitions. [2022-02-21 02:50:10,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-21 02:50:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 341 transitions. [2022-02-21 02:50:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 02:50:10,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:10,243 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:10,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-21 02:50:10,454 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-21 02:50:10,454 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:10,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1322442817, now seen corresponding path program 1 times [2022-02-21 02:50:10,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:10,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123143932] [2022-02-21 02:50:10,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:10,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:10,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:10,457 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-21 02:50:10,458 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-21 02:50:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 02:50:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:10,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:10,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {8754#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {8754#true} is VALID [2022-02-21 02:50:10,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {8754#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {8754#true} is VALID [2022-02-21 02:50:10,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {8754#true} is VALID [2022-02-21 02:50:10,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {8754#true} main_~i~4#1 := 0bv32; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 31: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {8754#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {8754#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {8754#true} havoc main_#t~nondet136#1; {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {8754#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {8754#true} assume !~bvslt32(main_~i~4#1, 10bv32); {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {8754#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L272 TraceCheckUtils]: 46: Hoare triple {8754#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {8754#true} ~cond := #in~cond; {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {8754#true} assume !(0bv32 == ~cond); {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {8754#true} assume true; {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8754#true} {8754#true} #320#return; {8754#true} is VALID [2022-02-21 02:50:10,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {8754#true} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {8754#true} is VALID [2022-02-21 02:50:10,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {8754#true} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1334 {8915#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:10,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {8915#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} main_~i~5#1 := 0bv32; {8915#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:10,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {8915#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} assume !~bvslt32(main_~i~5#1, main_~argc~0#1); {8915#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:10,826 INFO L290 TraceCheckUtils]: 55: Hoare triple {8915#(= (select |#valid| |ULTIMATE.start_main_~argv~0#1.base|) (_ bv1 1))} assume { :begin_inline___main } true;__main_#in~argc#1, __main_#in~argv#1.base, __main_#in~argv#1.offset := main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset;havoc __main_#res#1;havoc __main_#t~ret69#1.base, __main_#t~ret69#1.offset, __main_#t~ret70#1.base, __main_#t~ret70#1.offset, __main_#t~ret71#1, __main_#t~ret72#1, __main_~argc#1, __main_~argv#1.base, __main_~argv#1.offset, __main_~return_value_single_argv$1~0#1.base, __main_~return_value_single_argv$1~0#1.offset, __main_~return_value_dirname$2~0#1.base, __main_~return_value_dirname$2~0#1.offset, __main_~return_value_fflush_all$3~0#1;__main_~argc#1 := __main_#in~argc#1;__main_~argv#1.base, __main_~argv#1.offset := __main_#in~argv#1.base, __main_#in~argv#1.offset;havoc __main_~return_value_single_argv$1~0#1.base, __main_~return_value_single_argv$1~0#1.offset;assume { :begin_inline_single_argv } true;single_argv_#in~argv#1.base, single_argv_#in~argv#1.offset := __main_~argv#1.base, __main_~argv#1.offset;havoc single_argv_#res#1.base, single_argv_#res#1.offset;havoc single_argv_#t~mem74#1.base, single_argv_#t~mem74#1.offset, single_argv_#t~nondet75#1, single_argv_#t~ite76#1, single_argv_#t~mem77#1.base, single_argv_#t~mem77#1.offset, single_argv_#t~mem78#1, single_argv_#t~mem79#1, single_argv_#t~mem80#1, single_argv_#t~mem81#1, single_argv_#t~mem82#1, single_argv_#t~mem83#1, single_argv_#t~mem84#1, single_argv_#t~mem85#1, single_argv_~__s2~0#1.base, single_argv_~__s2~0#1.offset, single_argv_~__result~0#1, single_argv_#t~mem86#1.base, single_argv_#t~mem86#1.offset, single_argv_#t~nondet87#1, single_argv_~__s1_len~0#1, single_argv_~__s2_len~0#1, single_argv_#t~mem88#1.base, single_argv_#t~mem88#1.offset, single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset, single_argv_#t~ite90#1, single_argv_#t~mem91#1.base, single_argv_#t~mem91#1.offset, single_argv_~argv#1.base, single_argv_~argv#1.offset, single_argv_~tmp_statement_expression$1~0#1, single_argv_~tmp_if_expr$2~0#1, single_argv_~tmp_if_expr$5~0#1, single_argv_~tmp_statement_expression$3~0#1, single_argv_~return_value___builtin_strcmp$4~0#1, single_argv_~tmp_if_expr$6~0#1;single_argv_~argv#1.base, single_argv_~argv#1.offset := single_argv_#in~argv#1.base, single_argv_#in~argv#1.offset;havoc single_argv_~tmp_statement_expression$1~0#1;havoc single_argv_~tmp_if_expr$2~0#1;havoc single_argv_~tmp_if_expr$5~0#1;havoc single_argv_~tmp_statement_expression$3~0#1;havoc single_argv_~return_value___builtin_strcmp$4~0#1; {8925#(= (select |#valid| |ULTIMATE.start_single_argv_~argv#1.base|) (_ bv1 1))} is VALID [2022-02-21 02:50:10,827 INFO L290 TraceCheckUtils]: 56: Hoare triple {8925#(= (select |#valid| |ULTIMATE.start_single_argv_~argv#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[single_argv_~argv#1.base]); {8755#false} is VALID [2022-02-21 02:50:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:10,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:10,827 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:10,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123143932] [2022-02-21 02:50:10,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123143932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:10,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:10,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 02:50:10,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491343136] [2022-02-21 02:50:10,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:10,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:10,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:10,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-21 02:50:10,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:10,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 02:50:10,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:10,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 02:50:10,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 02:50:10,856 INFO L87 Difference]: Start difference. First operand 266 states and 341 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-21 02:50:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:12,041 INFO L93 Difference]: Finished difference Result 284 states and 363 transitions. [2022-02-21 02:50:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 02:50:12,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-21 02:50:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-02-21 02:50:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-21 02:50:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-02-21 02:50:12,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-02-21 02:50:12,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:12,247 INFO L225 Difference]: With dead ends: 284 [2022-02-21 02:50:12,247 INFO L226 Difference]: Without dead ends: 284 [2022-02-21 02:50:12,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-21 02:50:12,248 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 246 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:12,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 186 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 02:50:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-02-21 02:50:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2022-02-21 02:50:12,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:12,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 260 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 257 states have internal predecessors, (327), 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-21 02:50:12,257 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 260 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 257 states have internal predecessors, (327), 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-21 02:50:12,257 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 260 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 257 states have internal predecessors, (327), 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-21 02:50:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:12,261 INFO L93 Difference]: Finished difference Result 284 states and 363 transitions. [2022-02-21 02:50:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 363 transitions. [2022-02-21 02:50:12,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:12,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:12,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 260 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 257 states have internal predecessors, (327), 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) Second operand 284 states. [2022-02-21 02:50:12,262 INFO L87 Difference]: Start difference. First operand has 260 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 257 states have internal predecessors, (327), 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) Second operand 284 states. [2022-02-21 02:50:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:12,266 INFO L93 Difference]: Finished difference Result 284 states and 363 transitions. [2022-02-21 02:50:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 363 transitions. [2022-02-21 02:50:12,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:12,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:12,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:12,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 203 states have (on average 1.6108374384236452) internal successors, (327), 257 states have internal predecessors, (327), 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-21 02:50:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 329 transitions. [2022-02-21 02:50:12,270 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 329 transitions. Word has length 57 [2022-02-21 02:50:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:12,271 INFO L470 AbstractCegarLoop]: Abstraction has 260 states and 329 transitions. [2022-02-21 02:50:12,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-21 02:50:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 329 transitions. [2022-02-21 02:50:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 02:50:12,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:12,272 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:12,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-02-21 02:50:12,481 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-21 02:50:12,481 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:12,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:12,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1322442816, now seen corresponding path program 1 times [2022-02-21 02:50:12,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:12,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081458742] [2022-02-21 02:50:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:12,484 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-21 02:50:12,485 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-21 02:50:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:12,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:50:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:12,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:12,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {10042#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {10042#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {10042#true} main_~i~4#1 := 0bv32; {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {10042#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {10042#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {10042#true} havoc main_#t~nondet136#1; {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {10042#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {10042#true} assume !~bvslt32(main_~i~4#1, 10bv32); {10042#true} is VALID [2022-02-21 02:50:12,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {10042#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {10042#true} is VALID [2022-02-21 02:50:12,880 INFO L272 TraceCheckUtils]: 46: Hoare triple {10042#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {10042#true} is VALID [2022-02-21 02:50:12,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {10042#true} ~cond := #in~cond; {10188#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:12,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {10188#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {10192#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:12,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {10192#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {10192#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:12,881 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10192#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {10042#true} #320#return; {10199#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:12,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {10199#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {10199#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:12,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {10199#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1334 {10199#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:12,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {10199#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} main_~i~5#1 := 0bv32; {10209#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:12,884 INFO L290 TraceCheckUtils]: 54: Hoare triple {10209#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} assume !~bvslt32(main_~i~5#1, main_~argc~0#1); {10043#false} is VALID [2022-02-21 02:50:12,884 INFO L290 TraceCheckUtils]: 55: Hoare triple {10043#false} assume { :begin_inline___main } true;__main_#in~argc#1, __main_#in~argv#1.base, __main_#in~argv#1.offset := main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset;havoc __main_#res#1;havoc __main_#t~ret69#1.base, __main_#t~ret69#1.offset, __main_#t~ret70#1.base, __main_#t~ret70#1.offset, __main_#t~ret71#1, __main_#t~ret72#1, __main_~argc#1, __main_~argv#1.base, __main_~argv#1.offset, __main_~return_value_single_argv$1~0#1.base, __main_~return_value_single_argv$1~0#1.offset, __main_~return_value_dirname$2~0#1.base, __main_~return_value_dirname$2~0#1.offset, __main_~return_value_fflush_all$3~0#1;__main_~argc#1 := __main_#in~argc#1;__main_~argv#1.base, __main_~argv#1.offset := __main_#in~argv#1.base, __main_#in~argv#1.offset;havoc __main_~return_value_single_argv$1~0#1.base, __main_~return_value_single_argv$1~0#1.offset;assume { :begin_inline_single_argv } true;single_argv_#in~argv#1.base, single_argv_#in~argv#1.offset := __main_~argv#1.base, __main_~argv#1.offset;havoc single_argv_#res#1.base, single_argv_#res#1.offset;havoc single_argv_#t~mem74#1.base, single_argv_#t~mem74#1.offset, single_argv_#t~nondet75#1, single_argv_#t~ite76#1, single_argv_#t~mem77#1.base, single_argv_#t~mem77#1.offset, single_argv_#t~mem78#1, single_argv_#t~mem79#1, single_argv_#t~mem80#1, single_argv_#t~mem81#1, single_argv_#t~mem82#1, single_argv_#t~mem83#1, single_argv_#t~mem84#1, single_argv_#t~mem85#1, single_argv_~__s2~0#1.base, single_argv_~__s2~0#1.offset, single_argv_~__result~0#1, single_argv_#t~mem86#1.base, single_argv_#t~mem86#1.offset, single_argv_#t~nondet87#1, single_argv_~__s1_len~0#1, single_argv_~__s2_len~0#1, single_argv_#t~mem88#1.base, single_argv_#t~mem88#1.offset, single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset, single_argv_#t~ite90#1, single_argv_#t~mem91#1.base, single_argv_#t~mem91#1.offset, single_argv_~argv#1.base, single_argv_~argv#1.offset, single_argv_~tmp_statement_expression$1~0#1, single_argv_~tmp_if_expr$2~0#1, single_argv_~tmp_if_expr$5~0#1, single_argv_~tmp_statement_expression$3~0#1, single_argv_~return_value___builtin_strcmp$4~0#1, single_argv_~tmp_if_expr$6~0#1;single_argv_~argv#1.base, single_argv_~argv#1.offset := single_argv_#in~argv#1.base, single_argv_#in~argv#1.offset;havoc single_argv_~tmp_statement_expression$1~0#1;havoc single_argv_~tmp_if_expr$2~0#1;havoc single_argv_~tmp_if_expr$5~0#1;havoc single_argv_~tmp_statement_expression$3~0#1;havoc single_argv_~return_value___builtin_strcmp$4~0#1; {10043#false} is VALID [2022-02-21 02:50:12,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {10043#false} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(8bv64, single_argv_~argv#1.offset)), #length[single_argv_~argv#1.base]) && ~bvule64(~bvadd64(8bv64, single_argv_~argv#1.offset), ~bvadd64(8bv64, ~bvadd64(8bv64, single_argv_~argv#1.offset)))) && ~bvule64(0bv64, ~bvadd64(8bv64, single_argv_~argv#1.offset))); {10043#false} is VALID [2022-02-21 02:50:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:12,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:12,885 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:12,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081458742] [2022-02-21 02:50:12,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081458742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:12,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:12,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 02:50:12,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060255706] [2022-02-21 02:50:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:12,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:12,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-21 02:50:12,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:12,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 02:50:12,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 02:50:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 02:50:12,919 INFO L87 Difference]: Start difference. First operand 260 states and 329 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-21 02:50:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:14,729 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-02-21 02:50:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 02:50:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 57 [2022-02-21 02:50:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-21 02:50:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2022-02-21 02:50:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-21 02:50:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2022-02-21 02:50:14,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 199 transitions. [2022-02-21 02:50:14,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:14,989 INFO L225 Difference]: With dead ends: 218 [2022-02-21 02:50:14,989 INFO L226 Difference]: Without dead ends: 218 [2022-02-21 02:50:14,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-21 02:50:14,990 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 182 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:14,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 617 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 02:50:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-21 02:50:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 196. [2022-02-21 02:50:14,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:14,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 196 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 193 states have internal predecessors, (210), 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-21 02:50:14,993 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 196 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 193 states have internal predecessors, (210), 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-21 02:50:14,993 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 196 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 193 states have internal predecessors, (210), 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-21 02:50:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:14,996 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-02-21 02:50:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 235 transitions. [2022-02-21 02:50:14,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:14,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:14,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 193 states have internal predecessors, (210), 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) Second operand 218 states. [2022-02-21 02:50:14,997 INFO L87 Difference]: Start difference. First operand has 196 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 193 states have internal predecessors, (210), 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) Second operand 218 states. [2022-02-21 02:50:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:15,000 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2022-02-21 02:50:15,000 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 235 transitions. [2022-02-21 02:50:15,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:15,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:15,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:15,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.5107913669064748) internal successors, (210), 193 states have internal predecessors, (210), 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-21 02:50:15,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2022-02-21 02:50:15,003 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 57 [2022-02-21 02:50:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:15,003 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2022-02-21 02:50:15,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-21 02:50:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2022-02-21 02:50:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-21 02:50:15,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:15,004 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:15,024 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-21 02:50:15,211 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-21 02:50:15,211 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:15,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1953963627, now seen corresponding path program 1 times [2022-02-21 02:50:15,212 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:15,212 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603032046] [2022-02-21 02:50:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:15,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:15,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:15,213 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-21 02:50:15,214 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-21 02:50:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:15,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 02:50:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:15,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {11070#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {11070#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {11070#true} main_~i~4#1 := 0bv32; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 37: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 38: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 39: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 40: Hoare triple {11070#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {11070#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {11070#true} havoc main_#t~nondet136#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {11070#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {11070#true} is VALID [2022-02-21 02:50:15,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {11070#true} assume !~bvslt32(main_~i~4#1, 10bv32); {11070#true} is VALID [2022-02-21 02:50:15,568 INFO L290 TraceCheckUtils]: 45: Hoare triple {11070#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {11070#true} is VALID [2022-02-21 02:50:15,568 INFO L272 TraceCheckUtils]: 46: Hoare triple {11070#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {11070#true} is VALID [2022-02-21 02:50:15,568 INFO L290 TraceCheckUtils]: 47: Hoare triple {11070#true} ~cond := #in~cond; {11070#true} is VALID [2022-02-21 02:50:15,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {11070#true} assume !(0bv32 == ~cond); {11070#true} is VALID [2022-02-21 02:50:15,568 INFO L290 TraceCheckUtils]: 49: Hoare triple {11070#true} assume true; {11070#true} is VALID [2022-02-21 02:50:15,568 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11070#true} {11070#true} #320#return; {11070#true} is VALID [2022-02-21 02:50:15,569 INFO L290 TraceCheckUtils]: 51: Hoare triple {11070#true} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {11228#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} is VALID [2022-02-21 02:50:15,569 INFO L290 TraceCheckUtils]: 52: Hoare triple {11228#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1334 {11228#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} is VALID [2022-02-21 02:50:15,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {11228#(= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|)} main_~i~5#1 := 0bv32; {11235#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:15,570 INFO L290 TraceCheckUtils]: 54: Hoare triple {11235#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~5#1, main_~argc~0#1);call main_#t~malloc142#1.base, main_#t~malloc142#1.offset := #Ultimate.allocOnHeap(11bv64); {11235#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:15,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {11235#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1337 {11242#(and (bvule (bvadd (_ bv8 64) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:15,571 INFO L290 TraceCheckUtils]: 56: Hoare triple {11242#(and (bvule (bvadd (_ bv8 64) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} havoc main_#t~malloc142#1.base, main_#t~malloc142#1.offset; {11242#(and (bvule (bvadd (_ bv8 64) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:15,573 INFO L290 TraceCheckUtils]: 57: Hoare triple {11242#(and (bvule (bvadd (_ bv8 64) (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|) (select |#length| |ULTIMATE.start_main_~argv~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1)))), #length[main_~argv~0#1.base]) && ~bvule64(~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), ~bvadd64(8bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))))); {11071#false} is VALID [2022-02-21 02:50:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:15,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:15,574 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:15,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603032046] [2022-02-21 02:50:15,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603032046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:15,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:15,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 02:50:15,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478852320] [2022-02-21 02:50:15,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 58 [2022-02-21 02:50:15,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:15,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-21 02:50:15,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:15,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 02:50:15,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 02:50:15,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 02:50:15,605 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-21 02:50:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,461 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2022-02-21 02:50:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 02:50:17,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 58 [2022-02-21 02:50:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-21 02:50:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-02-21 02:50:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-21 02:50:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-02-21 02:50:17,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 198 transitions. [2022-02-21 02:50:17,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:17,720 INFO L225 Difference]: With dead ends: 214 [2022-02-21 02:50:17,720 INFO L226 Difference]: Without dead ends: 214 [2022-02-21 02:50:17,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 02:50:17,720 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 176 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:17,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 424 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 02:50:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-21 02:50:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 207. [2022-02-21 02:50:17,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:17,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 207 states, 151 states have (on average 1.509933774834437) internal successors, (228), 204 states have internal predecessors, (228), 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-21 02:50:17,723 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 207 states, 151 states have (on average 1.509933774834437) internal successors, (228), 204 states have internal predecessors, (228), 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-21 02:50:17,724 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 207 states, 151 states have (on average 1.509933774834437) internal successors, (228), 204 states have internal predecessors, (228), 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-21 02:50:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,727 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2022-02-21 02:50:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 231 transitions. [2022-02-21 02:50:17,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:17,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:17,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 151 states have (on average 1.509933774834437) internal successors, (228), 204 states have internal predecessors, (228), 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) Second operand 214 states. [2022-02-21 02:50:17,728 INFO L87 Difference]: Start difference. First operand has 207 states, 151 states have (on average 1.509933774834437) internal successors, (228), 204 states have internal predecessors, (228), 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) Second operand 214 states. [2022-02-21 02:50:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:17,731 INFO L93 Difference]: Finished difference Result 214 states and 231 transitions. [2022-02-21 02:50:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 231 transitions. [2022-02-21 02:50:17,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:17,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:17,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:17,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 151 states have (on average 1.509933774834437) internal successors, (228), 204 states have internal predecessors, (228), 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-21 02:50:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2022-02-21 02:50:17,734 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 58 [2022-02-21 02:50:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:17,734 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2022-02-21 02:50:17,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-21 02:50:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2022-02-21 02:50:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-21 02:50:17,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:17,735 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:17,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-21 02:50:17,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 02:50:17,946 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash 443330279, now seen corresponding path program 1 times [2022-02-21 02:50:17,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:17,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466633834] [2022-02-21 02:50:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:17,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:17,948 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 02:50:17,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-21 02:50:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:18,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 02:50:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:18,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:18,551 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-02-21 02:50:18,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-21 02:50:18,573 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-21 02:50:18,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-21 02:50:18,725 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 02:50:18,725 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 11 treesize of output 11 [2022-02-21 02:50:18,733 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 17 treesize of output 19 [2022-02-21 02:50:18,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {12097#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {12097#true} is VALID [2022-02-21 02:50:18,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {12097#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {12097#true} is VALID [2022-02-21 02:50:18,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {12097#true} main_~i~4#1 := 0bv32; {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 38: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {12097#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {12097#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {12097#true} havoc main_#t~nondet136#1; {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {12097#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {12097#true} assume !~bvslt32(main_~i~4#1, 10bv32); {12097#true} is VALID [2022-02-21 02:50:18,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {12097#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {12097#true} is VALID [2022-02-21 02:50:18,891 INFO L272 TraceCheckUtils]: 46: Hoare triple {12097#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {12097#true} is VALID [2022-02-21 02:50:18,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {12097#true} ~cond := #in~cond; {12243#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-21 02:50:18,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {12243#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {12247#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {12247#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {12247#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,893 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12247#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {12097#true} #320#return; {12254#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} is VALID [2022-02-21 02:50:18,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {12254#(and (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {12258#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:18,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {12258#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1334 {12258#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:18,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {12258#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} main_~i~5#1 := 0bv32; {12265#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {12265#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~5#1, main_~argc~0#1);call main_#t~malloc142#1.base, main_#t~malloc142#1.offset := #Ultimate.allocOnHeap(11bv64); {12269#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (not (= |ULTIMATE.start_main_~mem_track~0#1.base| |ULTIMATE.start_main_#t~malloc142#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {12269#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (not (= |ULTIMATE.start_main_~mem_track~0#1.base| |ULTIMATE.start_main_#t~malloc142#1.base|)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1337 {12273#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {12273#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} havoc main_#t~malloc142#1.base, main_#t~malloc142#1.offset; {12273#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {12273#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} SUMMARY for call main_#t~mem143#1.base, main_#t~mem143#1.offset := read~$Pointer$(main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1338 {12273#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} is VALID [2022-02-21 02:50:18,916 INFO L290 TraceCheckUtils]: 58: Hoare triple {12273#(and (exists ((|ULTIMATE.start_main_~argc~0#1| (_ BitVec 32))) (and (= (bvmul (_ bv8 64) ((_ sign_extend 32) (bvadd |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)))) (select |#length| |ULTIMATE.start_main_~mem_track~0#1.base|)) (bvsge |ULTIMATE.start_main_~argc~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~argc~0#1| (_ bv10000 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|) (= |ULTIMATE.start_main_~i~5#1| (_ bv0 32)))} assume !((~bvule64(~bvadd64(8bv64, ~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1)))), #length[main_~mem_track~0#1.base]) && ~bvule64(~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), ~bvadd64(8bv64, ~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1)))))) && ~bvule64(0bv64, ~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))))); {12098#false} is VALID [2022-02-21 02:50:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:18,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:18,917 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:18,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466633834] [2022-02-21 02:50:18,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466633834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:18,917 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:18,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 02:50:18,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978302857] [2022-02-21 02:50:18,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:18,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2022-02-21 02:50:18,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:18,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-21 02:50:18,958 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-21 02:50:18,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 02:50:18,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:18,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 02:50:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-21 02:50:18,959 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-21 02:50:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:20,740 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-02-21 02:50:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 02:50:20,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2022-02-21 02:50:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-21 02:50:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2022-02-21 02:50:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-21 02:50:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions. [2022-02-21 02:50:20,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 179 transitions. [2022-02-21 02:50:20,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:20,973 INFO L225 Difference]: With dead ends: 207 [2022-02-21 02:50:20,973 INFO L226 Difference]: Without dead ends: 207 [2022-02-21 02:50:20,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-21 02:50:20,974 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:20,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 918 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 225 Unchecked, 0.0s Time] [2022-02-21 02:50:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-21 02:50:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-02-21 02:50:20,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:20,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 207 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 204 states have internal predecessors, (227), 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-21 02:50:20,976 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 207 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 204 states have internal predecessors, (227), 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-21 02:50:20,977 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 207 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 204 states have internal predecessors, (227), 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-21 02:50:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:20,980 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-02-21 02:50:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2022-02-21 02:50:20,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:20,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:20,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 204 states have internal predecessors, (227), 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) Second operand 207 states. [2022-02-21 02:50:20,981 INFO L87 Difference]: Start difference. First operand has 207 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 204 states have internal predecessors, (227), 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) Second operand 207 states. [2022-02-21 02:50:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:20,984 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2022-02-21 02:50:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2022-02-21 02:50:20,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:20,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:20,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:20,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 151 states have (on average 1.5033112582781456) internal successors, (227), 204 states have internal predecessors, (227), 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-21 02:50:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2022-02-21 02:50:20,987 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 59 [2022-02-21 02:50:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:20,987 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2022-02-21 02:50:20,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-21 02:50:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2022-02-21 02:50:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-21 02:50:20,988 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:20,988 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:21,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-21 02:50:21,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 02:50:21,202 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:21,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash 443330278, now seen corresponding path program 1 times [2022-02-21 02:50:21,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:21,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155722826] [2022-02-21 02:50:21,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:21,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:21,204 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 02:50:21,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-21 02:50:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:21,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 02:50:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:21,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:21,675 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-21 02:50:21,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-21 02:50:21,707 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-21 02:50:21,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2022-02-21 02:50:21,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {13114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {13114#true} is VALID [2022-02-21 02:50:21,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {13114#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {13114#true} is VALID [2022-02-21 02:50:21,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {13114#true} is VALID [2022-02-21 02:50:21,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {13114#true} main_~i~4#1 := 0bv32; {13114#true} is VALID [2022-02-21 02:50:21,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {13114#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {13114#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L290 TraceCheckUtils]: 42: Hoare triple {13114#true} havoc main_#t~nondet136#1; {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {13114#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L290 TraceCheckUtils]: 44: Hoare triple {13114#true} assume !~bvslt32(main_~i~4#1, 10bv32); {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L290 TraceCheckUtils]: 45: Hoare triple {13114#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L272 TraceCheckUtils]: 46: Hoare triple {13114#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {13114#true} ~cond := #in~cond; {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {13114#true} assume !(0bv32 == ~cond); {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {13114#true} assume true; {13114#true} is VALID [2022-02-21 02:50:21,729 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13114#true} {13114#true} #320#return; {13114#true} is VALID [2022-02-21 02:50:21,732 INFO L290 TraceCheckUtils]: 51: Hoare triple {13114#true} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:21,732 INFO L290 TraceCheckUtils]: 52: Hoare triple {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1334 {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:21,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} main_~i~5#1 := 0bv32; {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:21,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} assume !!~bvslt32(main_~i~5#1, main_~argc~0#1);call main_#t~malloc142#1.base, main_#t~malloc142#1.offset := #Ultimate.allocOnHeap(11bv64); {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:21,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1337 {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:21,735 INFO L290 TraceCheckUtils]: 56: Hoare triple {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} havoc main_#t~malloc142#1.base, main_#t~malloc142#1.offset; {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:21,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} SUMMARY for call main_#t~mem143#1.base, main_#t~mem143#1.offset := read~$Pointer$(main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1338 {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} is VALID [2022-02-21 02:50:21,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {13272#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~mem_track~0#1.base|)))} assume !(1bv1 == #valid[main_~mem_track~0#1.base]); {13115#false} is VALID [2022-02-21 02:50:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:21,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:21,736 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:21,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155722826] [2022-02-21 02:50:21,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155722826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:21,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:21,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 02:50:21,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880488074] [2022-02-21 02:50:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 59 [2022-02-21 02:50:21,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:21,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-21 02:50:21,767 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-21 02:50:21,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 02:50:21,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 02:50:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:50:21,768 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-21 02:50:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:22,417 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2022-02-21 02:50:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 02:50:22,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 59 [2022-02-21 02:50:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-21 02:50:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-21 02:50:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-21 02:50:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-21 02:50:22,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2022-02-21 02:50:22,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:22,629 INFO L225 Difference]: With dead ends: 214 [2022-02-21 02:50:22,629 INFO L226 Difference]: Without dead ends: 214 [2022-02-21 02:50:22,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 02:50:22,630 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 132 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 02:50:22,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 145 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 02:50:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-02-21 02:50:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2022-02-21 02:50:22,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 02:50:22,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states. Second operand has 211 states, 156 states have (on average 1.5) internal successors, (234), 208 states have internal predecessors, (234), 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-21 02:50:22,634 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand has 211 states, 156 states have (on average 1.5) internal successors, (234), 208 states have internal predecessors, (234), 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-21 02:50:22,634 INFO L87 Difference]: Start difference. First operand 214 states. Second operand has 211 states, 156 states have (on average 1.5) internal successors, (234), 208 states have internal predecessors, (234), 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-21 02:50:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:22,636 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2022-02-21 02:50:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2022-02-21 02:50:22,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:22,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:22,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 156 states have (on average 1.5) internal successors, (234), 208 states have internal predecessors, (234), 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) Second operand 214 states. [2022-02-21 02:50:22,637 INFO L87 Difference]: Start difference. First operand has 211 states, 156 states have (on average 1.5) internal successors, (234), 208 states have internal predecessors, (234), 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) Second operand 214 states. [2022-02-21 02:50:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:22,640 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2022-02-21 02:50:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 236 transitions. [2022-02-21 02:50:22,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 02:50:22,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 02:50:22,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 02:50:22,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 02:50:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 156 states have (on average 1.5) internal successors, (234), 208 states have internal predecessors, (234), 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-21 02:50:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2022-02-21 02:50:22,643 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 59 [2022-02-21 02:50:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 02:50:22,644 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2022-02-21 02:50:22,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-21 02:50:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2022-02-21 02:50:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-21 02:50:22,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 02:50:22,644 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 02:50:22,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-21 02:50:22,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-21 02:50:22,858 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 69 more)] === [2022-02-21 02:50:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 02:50:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 227895600, now seen corresponding path program 1 times [2022-02-21 02:50:22,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-21 02:50:22,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091988660] [2022-02-21 02:50:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 02:50:22,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-21 02:50:22,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-21 02:50:22,860 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-21 02:50:22,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-21 02:50:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:23,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 02:50:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 02:50:23,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 02:50:23,360 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-21 02:50:23,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-02-21 02:50:23,493 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-02-21 02:50:23,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-02-21 02:50:23,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2022-02-21 02:50:23,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {14146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(18bv64, 2bv64);call #Ultimate.allocInit(3bv64, 3bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 3bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 3bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 4bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 4bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 4bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 5bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 5bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 5bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 6bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 6bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 6bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 7bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 7bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 7bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 8bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 8bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 8bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 9bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 9bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 9bv64, 2bv64, 1bv64);call #Ultimate.allocInit(3bv64, 10bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(45bv8, 10bv64, 1bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 10bv64, 2bv64, 1bv64);~applet_name~0.base, ~applet_name~0.offset := 0bv64, 0bv64;~bb_errno_location~0 := 0bv32;~#dir~0.base, ~#dir~0.offset := 11bv64, 0bv64;call #Ultimate.allocInit(42bv64, 11bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dir~0.base);~#dummy_utmp~0.base, ~#dummy_utmp~0.offset := 12bv64, 0bv64;call #Ultimate.allocInit(382bv64, 12bv64);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#dummy_utmp~0.base); {14146#true} is VALID [2022-02-21 02:50:23,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {14146#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset, main_#t~nondet136#1, main_#t~pre135#1, main_~i~4#1, main_#t~nondet137#1, main_#t~nondet138#1, main_#t~malloc139#1.base, main_#t~malloc139#1.offset, main_#t~malloc140#1.base, main_#t~malloc140#1.offset, main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem146#1.base, main_#t~mem146#1.offset, main_#t~nondet147#1, main_#t~pre145#1, main_~j~0#1, main_#t~pre141#1, main_~i~5#1, main_#t~ret148#1, main_#t~mem150#1.base, main_#t~mem150#1.offset, main_#t~pre149#1, main_~i~6#1, main_~a~0#1.base, main_~a~0#1.offset, main_~argc~0#1, main_~argv~0#1.base, main_~argv~0#1.offset, main_~mem_track~0#1.base, main_~mem_track~0#1.offset, main_~res~0#1;call main_#t~malloc134#1.base, main_#t~malloc134#1.offset := #Ultimate.allocOnHeap(11bv64);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc134#1.base, main_#t~malloc134#1.offset;havoc main_#t~malloc134#1.base, main_#t~malloc134#1.offset; {14146#true} is VALID [2022-02-21 02:50:23,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(0bv8, main_~a~0#1.base, ~bvadd64(10bv64, main_~a~0#1.offset), 1bv64); srcloc: L1324 {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {14146#true} main_~i~4#1 := 0bv32; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 25: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 26: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 27: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {14146#true} assume !!~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {14146#true} SUMMARY for call write~intINTTYPE1(main_#t~nondet136#1, main_~a~0#1.base, ~bvadd64(main_~a~0#1.offset, ~sign_extendFrom32To64(main_~i~4#1)), 1bv64); srcloc: L1326 {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {14146#true} havoc main_#t~nondet136#1; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {14146#true} main_#t~pre135#1 := ~bvadd32(1bv32, main_~i~4#1);main_~i~4#1 := ~bvadd32(1bv32, main_~i~4#1);havoc main_#t~pre135#1; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {14146#true} assume !~bvslt32(main_~i~4#1, 10bv32); {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 45: Hoare triple {14146#true} ~applet_name~0.base, ~applet_name~0.offset := main_~a~0#1.base, main_~a~0#1.offset;~bb_errno_location~0 := main_#t~nondet137#1;havoc main_#t~nondet137#1;~optind~0 := 1bv32;main_~argc~0#1 := main_#t~nondet138#1;havoc main_#t~nondet138#1; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L272 TraceCheckUtils]: 46: Hoare triple {14146#true} call assume_abort_if_not((if ~bvsge32(main_~argc~0#1, 1bv32) && ~bvsle32(main_~argc~0#1, 10000bv32) then 1bv32 else 0bv32)); {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {14146#true} ~cond := #in~cond; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {14146#true} assume !(0bv32 == ~cond); {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {14146#true} assume true; {14146#true} is VALID [2022-02-21 02:50:23,560 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14146#true} {14146#true} #320#return; {14146#true} is VALID [2022-02-21 02:50:23,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {14146#true} call main_#t~malloc139#1.base, main_#t~malloc139#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~argv~0#1.base, main_~argv~0#1.offset := main_#t~malloc139#1.base, main_#t~malloc139#1.offset;havoc main_#t~malloc139#1.base, main_#t~malloc139#1.offset;call main_#t~malloc140#1.base, main_#t~malloc140#1.offset := #Ultimate.allocOnHeap(~bvmul64(8bv64, ~sign_extendFrom32To64(~bvadd32(1bv32, main_~argc~0#1))));main_~mem_track~0#1.base, main_~mem_track~0#1.offset := main_#t~malloc140#1.base, main_#t~malloc140#1.offset;havoc main_#t~malloc140#1.base, main_#t~malloc140#1.offset; {14304#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:23,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {14304#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call write~$Pointer$(0bv64, 0bv64, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~argc~0#1))), 8bv64); srcloc: L1334 {14304#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:23,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {14304#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} main_~i~5#1 := 0bv32; {14304#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:23,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {14304#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} assume !!~bvslt32(main_~i~5#1, main_~argc~0#1);call main_#t~malloc142#1.base, main_#t~malloc142#1.offset := #Ultimate.allocOnHeap(11bv64); {14314#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_#t~malloc142#1.base|) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:23,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {14314#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_#t~malloc142#1.base|) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call write~$Pointer$(main_#t~malloc142#1.base, main_#t~malloc142#1.offset, main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1337 {14318#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:23,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {14318#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} havoc main_#t~malloc142#1.base, main_#t~malloc142#1.offset; {14318#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:23,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {14318#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call main_#t~mem143#1.base, main_#t~mem143#1.offset := read~$Pointer$(main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1338 {14325#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_#t~mem143#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} is VALID [2022-02-21 02:50:23,569 INFO L290 TraceCheckUtils]: 58: Hoare triple {14325#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)) (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= |ULTIMATE.start_main_#t~mem143#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|))) (= (_ bv0 64) |ULTIMATE.start_main_~mem_track~0#1.offset|))} SUMMARY for call write~$Pointer$(main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~mem_track~0#1.base, ~bvadd64(main_~mem_track~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1338-1 {14329#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|)))) (_ bv1 1))))} is VALID [2022-02-21 02:50:23,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {14329#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|)))) (_ bv1 1))))} havoc main_#t~mem143#1.base, main_#t~mem143#1.offset; {14329#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|)))) (_ bv1 1))))} is VALID [2022-02-21 02:50:23,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {14329#(and (= (_ bv0 64) |ULTIMATE.start_main_~argv~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |ULTIMATE.start_main_~i~5#1|) (_ bv8 64)) |ULTIMATE.start_main_~argv~0#1.offset|)))) (_ bv1 1))))} SUMMARY for call main_#t~mem144#1.base, main_#t~mem144#1.offset := read~$Pointer$(main_~argv~0#1.base, ~bvadd64(main_~argv~0#1.offset, ~bvmul64(8bv64, ~sign_extendFrom32To64(main_~i~5#1))), 8bv64); srcloc: L1339 {14336#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_#t~mem144#1.base|)) (_ bv1 1)))} is VALID [2022-02-21 02:50:23,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {14336#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_#t~mem144#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[main_#t~mem144#1.base]); {14147#false} is VALID [2022-02-21 02:50:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-02-21 02:50:23,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 02:50:23,571 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-21 02:50:23,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091988660] [2022-02-21 02:50:23,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091988660] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 02:50:23,571 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 02:50:23,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 02:50:23,571 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415216238] [2022-02-21 02:50:23,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 02:50:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2022-02-21 02:50:23,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 02:50:23,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-21 02:50:27,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-21 02:50:27,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 02:50:27,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-21 02:50:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 02:50:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 02:50:27,636 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-21 02:50:30,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-21 02:50:32,175 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-21 02:50:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 02:50:34,046 INFO L93 Difference]: Finished difference Result 209 states and 232 transitions. [2022-02-21 02:50:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 02:50:34,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2022-02-21 02:50:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 02:50:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-21 02:50:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2022-02-21 02:50:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-21 02:50:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2022-02-21 02:50:34,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 171 transitions.