./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:42:45,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:42:45,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:42:45,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:42:45,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:42:45,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:42:45,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:42:45,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:42:45,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:42:45,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:42:45,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:42:45,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:42:45,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:42:45,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:42:45,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:42:45,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:42:45,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:42:45,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:42:45,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:42:45,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:42:45,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:42:45,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:42:45,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:42:45,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:42:45,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:42:45,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:42:45,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:42:45,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:42:45,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:42:45,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:42:45,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:42:45,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:42:45,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:42:45,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:42:45,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:42:45,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:42:45,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:42:45,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:42:45,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:42:45,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:42:45,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:42:45,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:42:45,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:42:45,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:42:45,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:42:45,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:42:45,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:42:45,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:42:45,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:42:45,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:42:45,332 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:42:45,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:42:45,333 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:42:45,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:42:45,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:42:45,333 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:42:45,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:42:45,334 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:42:45,334 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:42:45,334 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:42:45,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:42:45,334 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:42:45,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:42:45,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:42:45,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:42:45,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:42:45,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:42:45,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:42:45,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:42:45,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:42:45,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:42:45,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:42:45,337 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf [2022-02-20 23:42:45,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:42:45,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:42:45,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:42:45,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:42:45,536 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:42:45,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2022-02-20 23:42:45,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71abcdd5a/9148645a58f1446da41482bc005651a4/FLAG7b02ec735 [2022-02-20 23:42:45,987 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:42:45,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2022-02-20 23:42:46,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71abcdd5a/9148645a58f1446da41482bc005651a4/FLAG7b02ec735 [2022-02-20 23:42:46,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71abcdd5a/9148645a58f1446da41482bc005651a4 [2022-02-20 23:42:46,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:42:46,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:42:46,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:42:46,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:42:46,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:42:46,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:42:46" (1/1) ... [2022-02-20 23:42:46,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bfc2ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:46, skipping insertion in model container [2022-02-20 23:42:46,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:42:46" (1/1) ... [2022-02-20 23:42:46,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:42:46,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:42:46,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:42:46,256 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:42:46,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@58792466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:46, skipping insertion in model container [2022-02-20 23:42:46,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:42:46,258 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:42:46,261 INFO L158 Benchmark]: Toolchain (without parser) took 242.24ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.6MB in the beginning and 86.4MB in the end (delta: -23.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:42:46,262 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:42:46,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.38ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.3MB in the beginning and 86.4MB in the end (delta: -24.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:42:46,264 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 52.7MB in the beginning and 52.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.38ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 62.3MB in the beginning and 86.4MB in the end (delta: -24.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/array-memsafety-realloc/array-realloc-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:42:47,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:42:47,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:42:47,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:42:47,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:42:47,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:42:47,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:42:47,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:42:47,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:42:47,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:42:47,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:42:47,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:42:47,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:42:47,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:42:47,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:42:47,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:42:47,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:42:47,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:42:47,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:42:47,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:42:47,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:42:47,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:42:47,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:42:47,735 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:42:47,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:42:47,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:42:47,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:42:47,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:42:47,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:42:47,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:42:47,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:42:47,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:42:47,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:42:47,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:42:47,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:42:47,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:42:47,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:42:47,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:42:47,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:42:47,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:42:47,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:42:47,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:42:47,789 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:42:47,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:42:47,790 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:42:47,790 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:42:47,791 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:42:47,791 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:42:47,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:42:47,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:42:47,792 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:42:47,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:42:47,793 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:42:47,793 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:42:47,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:42:47,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:42:47,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:42:47,794 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:42:47,795 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:42:47,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:42:47,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:42:47,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:42:47,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:42:47,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:42:47,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:42:47,796 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:42:47,796 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:42:47,796 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:42:47,796 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf [2022-02-20 23:42:48,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:42:48,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:42:48,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:42:48,038 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:42:48,039 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:42:48,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2022-02-20 23:42:48,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021913529/79788ba6a43c47bc8161f4f0b11b0fbe/FLAG710f989af [2022-02-20 23:42:48,491 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:42:48,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2022-02-20 23:42:48,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021913529/79788ba6a43c47bc8161f4f0b11b0fbe/FLAG710f989af [2022-02-20 23:42:48,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/021913529/79788ba6a43c47bc8161f4f0b11b0fbe [2022-02-20 23:42:48,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:42:48,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:42:48,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:42:48,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:42:48,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:42:48,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:42:48" (1/1) ... [2022-02-20 23:42:48,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4454b024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:48, skipping insertion in model container [2022-02-20 23:42:48,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:42:48" (1/1) ... [2022-02-20 23:42:48,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:42:48,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:42:49,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:42:49,125 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:42:49,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:42:49,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:42:49,181 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:42:49,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:42:49,237 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:42:49,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49 WrapperNode [2022-02-20 23:42:49,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:42:49,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:42:49,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:42:49,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:42:49,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,281 INFO L137 Inliner]: procedures = 118, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2022-02-20 23:42:49,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:42:49,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:42:49,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:42:49,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:42:49,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:42:49,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:42:49,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:42:49,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:42:49,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (1/1) ... [2022-02-20 23:42:49,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:42:49,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:42:49,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:42:49,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:42:49,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:42:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:42:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:42:49,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:42:49,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:42:49,500 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:42:49,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:42:49,750 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:42:49,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:42:49,755 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 23:42:49,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:42:49 BoogieIcfgContainer [2022-02-20 23:42:49,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:42:49,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:42:49,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:42:49,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:42:49,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:42:48" (1/3) ... [2022-02-20 23:42:49,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b47536c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:42:49, skipping insertion in model container [2022-02-20 23:42:49,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:42:49" (2/3) ... [2022-02-20 23:42:49,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b47536c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:42:49, skipping insertion in model container [2022-02-20 23:42:49,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:42:49" (3/3) ... [2022-02-20 23:42:49,761 INFO L111 eAbstractionObserver]: Analyzing ICFG array-realloc-1.i [2022-02-20 23:42:49,765 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:42:49,765 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-02-20 23:42:49,796 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:42:49,803 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:42:49,803 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-02-20 23:42:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:42:49,822 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:49,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:42:49,823 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash 925656, now seen corresponding path program 1 times [2022-02-20 23:42:49,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:49,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879102504] [2022-02-20 23:42:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:49,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:49,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:49,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:49,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:42:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:49,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:42:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:49,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:49,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {33#true} is VALID [2022-02-20 23:42:49,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {41#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:42:49,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));main_#res#1 := 0bv32; {41#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:42:49,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {41#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {34#false} is VALID [2022-02-20 23:42:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:49,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:49,945 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:49,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879102504] [2022-02-20 23:42:49,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879102504] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:49,946 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:49,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:42:49,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279107444] [2022-02-20 23:42:49,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:42:49,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:49,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:49,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:49,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:49,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:49,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:49,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:49,982 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:50,105 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 23:42:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:50,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:42:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 23:42:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 23:42:50,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-02-20 23:42:50,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:50,181 INFO L225 Difference]: With dead ends: 31 [2022-02-20 23:42:50,181 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:42:50,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:50,187 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:50,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:42:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 23:42:50,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:50,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,210 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,210 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:50,212 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 23:42:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 23:42:50,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:50,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:50,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:42:50,213 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:42:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:50,215 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 23:42:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 23:42:50,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:50,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:50,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:50,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-02-20 23:42:50,218 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 4 [2022-02-20 23:42:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:50,218 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-02-20 23:42:50,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 23:42:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:42:50,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:50,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:42:50,233 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-20 23:42:50,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:50,432 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 28695828, now seen corresponding path program 1 times [2022-02-20 23:42:50,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:50,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081963687] [2022-02-20 23:42:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:50,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:50,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:50,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:50,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:42:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:50,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:42:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:50,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:50,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {162#true} is VALID [2022-02-20 23:42:50,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {162#true} is VALID [2022-02-20 23:42:50,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {173#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:50,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {173#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} assume main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32;main_#res#1 := 0bv32; {163#false} is VALID [2022-02-20 23:42:50,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#false} assume !(#valid == main_old_#valid#1); {163#false} is VALID [2022-02-20 23:42:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:50,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:50,491 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:50,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081963687] [2022-02-20 23:42:50,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081963687] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:50,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:50,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:42:50,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945311902] [2022-02-20 23:42:50,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:50,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:50,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:50,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:50,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:50,500 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:50,549 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:42:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:42:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:42:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 23:42:50,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-02-20 23:42:50,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:50,595 INFO L225 Difference]: With dead ends: 28 [2022-02-20 23:42:50,595 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 23:42:50,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:50,598 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:50,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 23:42:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 23:42:50,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:50,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,603 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,604 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:50,605 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:42:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:42:50,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:50,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:50,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:42:50,608 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states. [2022-02-20 23:42:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:50,611 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 23:42:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:42:50,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:50,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:50,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:50,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-02-20 23:42:50,614 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 5 [2022-02-20 23:42:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:50,624 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-02-20 23:42:50,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-20 23:42:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:42:50,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:50,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:50,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:42:50,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:50,834 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910252, now seen corresponding path program 1 times [2022-02-20 23:42:50,835 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:50,835 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407620276] [2022-02-20 23:42:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:50,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:50,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:50,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:42:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:50,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:42:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:50,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:50,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {291#true} is VALID [2022-02-20 23:42:50,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {291#true} is VALID [2022-02-20 23:42:50,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {291#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {291#true} is VALID [2022-02-20 23:42:50,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {291#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {305#(and (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|) (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:50,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {305#(and (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|) (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} assume !~bvslt32(~newsize~0, ~num~0); {305#(and (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|) (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:50,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(and (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|) (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} assume expandArray_~b~0#1.base != 0bv32 || expandArray_~b~0#1.offset != 0bv32; {292#false} is VALID [2022-02-20 23:42:50,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#false} assume !(0bv32 == expandArray_~b~0#1.offset); {292#false} is VALID [2022-02-20 23:42:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:50,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:50,949 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:50,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407620276] [2022-02-20 23:42:50,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407620276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:50,953 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:50,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:42:50,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029437559] [2022-02-20 23:42:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:50,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:42:50,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:50,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:50,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:50,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:50,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:50,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:50,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:50,968 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:51,052 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 23:42:51,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:42:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 23:42:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 23:42:51,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-20 23:42:51,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:51,094 INFO L225 Difference]: With dead ends: 42 [2022-02-20 23:42:51,095 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 23:42:51,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:51,095 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:51,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 45 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 23:42:51,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-02-20 23:42:51,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:51,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,098 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,098 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:51,100 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 23:42:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-02-20 23:42:51,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:51,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:51,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 23:42:51,100 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 23:42:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:51,101 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-02-20 23:42:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-02-20 23:42:51,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:51,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:51,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:51,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 23:42:51,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2022-02-20 23:42:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:51,103 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 23:42:51,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 23:42:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:42:51,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:51,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:51,113 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-20 23:42:51,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:51,304 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash 179688781, now seen corresponding path program 1 times [2022-02-20 23:42:51,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:51,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355457630] [2022-02-20 23:42:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:51,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:51,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:42:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:51,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:42:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:51,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:51,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {470#true} is VALID [2022-02-20 23:42:51,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {470#true} is VALID [2022-02-20 23:42:51,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {470#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {481#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:51,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {481#(not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32)))} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {485#(not (= (_ bv0 32) |ULTIMATE.start_expandArray_~a~0#1.base|))} is VALID [2022-02-20 23:42:51,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {485#(not (= (_ bv0 32) |ULTIMATE.start_expandArray_~a~0#1.base|))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {489#(not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:51,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#(not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 32)))} assume #Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32;call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1); {471#false} is VALID [2022-02-20 23:42:51,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#false} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {471#false} is VALID [2022-02-20 23:42:51,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#false} assume !(1bv1 == #valid[expandArray_~b~0#1.base]); {471#false} is VALID [2022-02-20 23:42:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:51,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:51,390 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:51,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355457630] [2022-02-20 23:42:51,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355457630] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:51,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:51,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:42:51,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453283737] [2022-02-20 23:42:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:51,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:42:51,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:51,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:51,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:42:51,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:42:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:42:51,400 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:51,603 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-02-20 23:42:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:42:51,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:42:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 23:42:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 23:42:51,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-02-20 23:42:51,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:51,677 INFO L225 Difference]: With dead ends: 64 [2022-02-20 23:42:51,677 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 23:42:51,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:42:51,678 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 105 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:51,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 23:42:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 31. [2022-02-20 23:42:51,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:51,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 31 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,681 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 31 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,681 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 31 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:51,682 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-02-20 23:42:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-02-20 23:42:51,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:51,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:51,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 23:42:51,683 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 64 states. [2022-02-20 23:42:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:51,687 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-02-20 23:42:51,687 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-02-20 23:42:51,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:51,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:51,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:51,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-20 23:42:51,689 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 8 [2022-02-20 23:42:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:51,690 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-20 23:42:51,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 23:42:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:42:51,690 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:51,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:51,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:42:51,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:51,896 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash 179690703, now seen corresponding path program 1 times [2022-02-20 23:42:51,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:51,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169960795] [2022-02-20 23:42:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:51,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:51,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:51,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:51,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:42:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:51,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:42:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:51,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:51,995 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:42:51,996 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-20 23:42:52,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {727#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {727#true} is VALID [2022-02-20 23:42:52,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {727#true} is VALID [2022-02-20 23:42:52,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {727#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {727#true} is VALID [2022-02-20 23:42:52,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {727#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {727#true} is VALID [2022-02-20 23:42:52,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {727#true} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {727#true} is VALID [2022-02-20 23:42:52,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#true} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {747#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:42:52,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {747#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (_ bv1 1)) (_ bv0 1))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {751#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_expandArray_~b~0#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:42:52,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {751#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_expandArray_~b~0#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[expandArray_~b~0#1.base]); {728#false} is VALID [2022-02-20 23:42:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:52,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:52,027 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:52,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169960795] [2022-02-20 23:42:52,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169960795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:52,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:52,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:42:52,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529184285] [2022-02-20 23:42:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:52,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:42:52,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:52,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:52,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:42:52,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:52,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:42:52,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:42:52,036 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:52,199 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 23:42:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:42:52,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:42:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-02-20 23:42:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-02-20 23:42:52,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-02-20 23:42:52,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:52,244 INFO L225 Difference]: With dead ends: 38 [2022-02-20 23:42:52,244 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 23:42:52,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:42:52,245 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:52,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:42:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 23:42:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-02-20 23:42:52,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:52,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,247 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,247 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:52,248 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 23:42:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 23:42:52,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:52,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:52,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 23:42:52,249 INFO L87 Difference]: Start difference. First operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 23:42:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:52,250 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-20 23:42:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-02-20 23:42:52,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:52,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:52,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:52,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 23:42:52,251 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2022-02-20 23:42:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:52,251 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 23:42:52,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 23:42:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:42:52,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:52,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:52,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 23:42:52,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:52,458 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash 179690704, now seen corresponding path program 1 times [2022-02-20 23:42:52,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:52,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228912168] [2022-02-20 23:42:52,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:52,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:52,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:52,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:52,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:42:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:52,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:42:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:52,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:52,570 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 8 treesize of output 7 [2022-02-20 23:42:52,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {899#true} is VALID [2022-02-20 23:42:52,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {899#true} is VALID [2022-02-20 23:42:52,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {899#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {899#true} is VALID [2022-02-20 23:42:52,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {913#(= ~newsize~0 (_ bv0 32))} is VALID [2022-02-20 23:42:52,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {913#(= ~newsize~0 (_ bv0 32))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {917#(and (= |ULTIMATE.start_#Ultimate.C_realloc_size#1| (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} is VALID [2022-02-20 23:42:52,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#(and (= |ULTIMATE.start_#Ultimate.C_realloc_size#1| (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {921#(and (= |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} is VALID [2022-02-20 23:42:52,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {921#(and (= |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {925#(and (= (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|))} is VALID [2022-02-20 23:42:52,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {925#(and (= (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= ~newsize~0 (_ bv1 32)) (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))), #length[expandArray_~b~0#1.base]) && ~bvule32(~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), ~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))))) && ~bvule32(0bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))))); {900#false} is VALID [2022-02-20 23:42:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:52,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:52,627 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:52,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228912168] [2022-02-20 23:42:52,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228912168] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:52,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:52,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:42:52,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162051984] [2022-02-20 23:42:52,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:52,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:42:52,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:52,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:52,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:42:52,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:52,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:42:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:42:52,638 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:52,944 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-02-20 23:42:52,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:42:52,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:42:52,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-02-20 23:42:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-02-20 23:42:52,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-02-20 23:42:53,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:53,003 INFO L225 Difference]: With dead ends: 58 [2022-02-20 23:42:53,003 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 23:42:53,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:42:53,004 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:53,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 85 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:42:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 23:42:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2022-02-20 23:42:53,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:53,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,006 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,006 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,007 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-02-20 23:42:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-02-20 23:42:53,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:53,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:53,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2022-02-20 23:42:53,008 INFO L87 Difference]: Start difference. First operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 58 states. [2022-02-20 23:42:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,011 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-02-20 23:42:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-02-20 23:42:53,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:53,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:53,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:53,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-02-20 23:42:53,012 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2022-02-20 23:42:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:53,012 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-02-20 23:42:53,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-02-20 23:42:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:42:53,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:53,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:53,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:42:53,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:53,221 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1274213166, now seen corresponding path program 1 times [2022-02-20 23:42:53,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:53,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788676525] [2022-02-20 23:42:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:53,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:53,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:42:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:53,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:42:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:53,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:53,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {1141#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {1141#true} is VALID [2022-02-20 23:42:53,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1141#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {1141#true} is VALID [2022-02-20 23:42:53,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {1141#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:42:53,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:42:53,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} assume !~bvslt32(~newsize~0, ~num~0); {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:42:53,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} assume !(expandArray_~b~0#1.base != 0bv32 || expandArray_~b~0#1.offset != 0bv32); {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:42:53,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} expandArray_#res#1.base, expandArray_#res#1.offset := 0bv32, 0bv32; {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:42:53,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} main_#t~ret5#1.base, main_#t~ret5#1.offset := expandArray_#res#1.base, expandArray_#res#1.offset;assume { :end_inline_expandArray } true;havoc main_#t~ret5#1.base, main_#t~ret5#1.offset; {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:42:53,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {1152#(= |ULTIMATE.start_main_~a~1#1.offset| (_ bv0 32))} assume !(0bv32 == main_~a~1#1.offset); {1142#false} is VALID [2022-02-20 23:42:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:53,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:53,284 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:53,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788676525] [2022-02-20 23:42:53,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788676525] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:53,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:53,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:42:53,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34324461] [2022-02-20 23:42:53,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:42:53,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:53,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:53,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:53,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:53,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:53,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:53,293 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,328 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 23:42:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:53,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:42:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-02-20 23:42:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-02-20 23:42:53,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-02-20 23:42:53,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:53,353 INFO L225 Difference]: With dead ends: 34 [2022-02-20 23:42:53,353 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 23:42:53,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:53,354 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:53,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:53,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 23:42:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 23:42:53,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:53,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,357 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,357 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,357 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 23:42:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 23:42:53,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:53,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:53,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 23:42:53,358 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 23:42:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,358 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-20 23:42:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 23:42:53,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:53,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:53,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:53,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-02-20 23:42:53,360 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 9 [2022-02-20 23:42:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:53,360 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-02-20 23:42:53,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-20 23:42:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:42:53,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:53,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:53,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:42:53,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:53,570 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash 845902566, now seen corresponding path program 1 times [2022-02-20 23:42:53,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:53,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810248675] [2022-02-20 23:42:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:53,571 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:53,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:42:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:53,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:42:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:53,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:53,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {1306#true} is VALID [2022-02-20 23:42:53,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {1306#true} is VALID [2022-02-20 23:42:53,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:53,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:53,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} assume !~bvslt32(~newsize~0, ~num~0); {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:53,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} assume !(expandArray_~b~0#1.base != 0bv32 || expandArray_~b~0#1.offset != 0bv32); {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:53,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} expandArray_#res#1.base, expandArray_#res#1.offset := 0bv32, 0bv32; {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:53,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} main_#t~ret5#1.base, main_#t~ret5#1.offset := expandArray_#res#1.base, expandArray_#res#1.offset;assume { :end_inline_expandArray } true;havoc main_#t~ret5#1.base, main_#t~ret5#1.offset; {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:53,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} assume 0bv32 == main_~a~1#1.offset; {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:53,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {1317#(bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)} assume !~bvult32(main_~a~1#1.base, #StackHeapBarrier); {1307#false} is VALID [2022-02-20 23:42:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:53,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:53,644 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:53,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810248675] [2022-02-20 23:42:53,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810248675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:53,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:53,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:42:53,645 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575881015] [2022-02-20 23:42:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:53,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:42:53,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:53,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:53,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:53,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:53,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:53,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:53,660 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,707 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 23:42:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:53,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:42:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:42:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-02-20 23:42:53,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2022-02-20 23:42:53,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:53,733 INFO L225 Difference]: With dead ends: 33 [2022-02-20 23:42:53,733 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 23:42:53,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:53,734 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:53,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 23:42:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 23:42:53,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:53,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,736 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,736 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,737 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 23:42:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 23:42:53,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:53,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:53,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 23:42:53,738 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 23:42:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:53,739 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-02-20 23:42:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 23:42:53,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:53,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:53,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:53,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-02-20 23:42:53,740 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 10 [2022-02-20 23:42:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:53,740 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-02-20 23:42:53,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-02-20 23:42:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:42:53,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:53,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:53,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:42:53,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:53,947 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash 453175856, now seen corresponding path program 1 times [2022-02-20 23:42:53,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:53,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813781485] [2022-02-20 23:42:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:53,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:53,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:53,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:53,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:42:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:53,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:42:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:53,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:54,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:42:54,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {1470#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {1470#true} is VALID [2022-02-20 23:42:54,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {1470#true} is VALID [2022-02-20 23:42:54,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,041 INFO L290 TraceCheckUtils]: 3: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,041 INFO L290 TraceCheckUtils]: 4: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} assume !~bvslt32(~newsize~0, ~num~0); {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} assume !(expandArray_~b~0#1.base != 0bv32 || expandArray_~b~0#1.offset != 0bv32); {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} expandArray_#res#1.base, expandArray_#res#1.offset := 0bv32, 0bv32; {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} main_#t~ret5#1.base, main_#t~ret5#1.offset := expandArray_#res#1.base, expandArray_#res#1.offset;assume { :end_inline_expandArray } true;havoc main_#t~ret5#1.base, main_#t~ret5#1.offset; {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} assume 0bv32 == main_~a~1#1.offset; {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} assume ~bvult32(main_~a~1#1.base, #StackHeapBarrier); {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:42:54,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {1481#(= (select |#valid| |ULTIMATE.start_main_~a~1#1.base|) (_ bv1 1))} assume !(0bv32 == main_~a~1#1.base || 1bv1 == #valid[main_~a~1#1.base]); {1471#false} is VALID [2022-02-20 23:42:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:54,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:54,044 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:54,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813781485] [2022-02-20 23:42:54,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813781485] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:54,044 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:54,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:42:54,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45564998] [2022-02-20 23:42:54,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:42:54,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:54,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:54,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:42:54,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:42:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:54,056 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:54,119 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 23:42:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:42:54,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:42:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 23:42:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-20 23:42:54,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-02-20 23:42:54,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:54,152 INFO L225 Difference]: With dead ends: 38 [2022-02-20 23:42:54,152 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 23:42:54,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:42:54,152 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:54,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 23:42:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 23:42:54,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:54,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,154 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,154 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:54,155 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 23:42:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 23:42:54,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:54,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:54,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 23:42:54,155 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 23:42:54,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:54,156 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-02-20 23:42:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 23:42:54,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:54,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:54,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:54,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-02-20 23:42:54,160 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2022-02-20 23:42:54,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:54,160 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-02-20 23:42:54,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-02-20 23:42:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:42:54,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:54,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:54,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:42:54,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:54,363 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1163549737, now seen corresponding path program 1 times [2022-02-20 23:42:54,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:54,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044706779] [2022-02-20 23:42:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:54,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:54,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:42:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:54,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:42:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:54,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:54,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {1657#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {1657#true} is VALID [2022-02-20 23:42:54,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {1657#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {1657#true} is VALID [2022-02-20 23:42:54,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {1657#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1668#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)))} is VALID [2022-02-20 23:42:54,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {1668#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)))} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {1672#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)) (= ~newsize~0 (_ bv0 32)))} is VALID [2022-02-20 23:42:54,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {1672#(and (bvsgt ~num~0 (_ bv0 32)) (bvslt ~num~0 (_ bv100 32)) (= ~newsize~0 (_ bv0 32)))} assume !~bvslt32(~newsize~0, ~num~0); {1658#false} is VALID [2022-02-20 23:42:54,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {1658#false} assume !(expandArray_~b~0#1.base != 0bv32 || expandArray_~b~0#1.offset != 0bv32); {1658#false} is VALID [2022-02-20 23:42:54,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {1658#false} expandArray_#res#1.base, expandArray_#res#1.offset := 0bv32, 0bv32; {1658#false} is VALID [2022-02-20 23:42:54,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {1658#false} main_#t~ret5#1.base, main_#t~ret5#1.offset := expandArray_#res#1.base, expandArray_#res#1.offset;assume { :end_inline_expandArray } true;havoc main_#t~ret5#1.base, main_#t~ret5#1.offset; {1658#false} is VALID [2022-02-20 23:42:54,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {1658#false} assume 0bv32 == main_~a~1#1.offset; {1658#false} is VALID [2022-02-20 23:42:54,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {1658#false} assume ~bvult32(main_~a~1#1.base, #StackHeapBarrier); {1658#false} is VALID [2022-02-20 23:42:54,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {1658#false} assume 0bv32 == main_~a~1#1.base || 1bv1 == #valid[main_~a~1#1.base];call ULTIMATE.dealloc(main_~a~1#1.base, main_~a~1#1.offset);main_#res#1 := 0bv32; {1658#false} is VALID [2022-02-20 23:42:54,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#false} assume !(#valid == main_old_#valid#1); {1658#false} is VALID [2022-02-20 23:42:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:54,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:54,466 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:54,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044706779] [2022-02-20 23:42:54,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044706779] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:54,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:54,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:42:54,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759189358] [2022-02-20 23:42:54,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:54,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:42:54,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:54,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:54,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:42:54,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:42:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:42:54,477 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:54,551 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:42:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:42:54,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:42:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 23:42:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 23:42:54,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-02-20 23:42:54,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:54,601 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:42:54,601 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:42:54,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:42:54,601 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:54,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:42:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:42:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 23:42:54,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:54,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,603 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,603 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:54,604 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:42:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:42:54,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:54,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:54,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 23:42:54,604 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 23:42:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:54,605 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 23:42:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:42:54,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:54,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:54,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:54,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-20 23:42:54,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 12 [2022-02-20 23:42:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:54,606 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-20 23:42:54,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 23:42:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:42:54,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:54,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:54,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:42:54,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:54,813 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:54,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash 702945990, now seen corresponding path program 1 times [2022-02-20 23:42:54,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:54,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030135988] [2022-02-20 23:42:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:54,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:54,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:54,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:54,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:42:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:54,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:42:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:54,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:55,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {1824#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {1829#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:55,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {1829#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:42:55,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1829#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1836#(exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)))} is VALID [2022-02-20 23:42:55,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {1836#(exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)))} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {1836#(exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)))} is VALID [2022-02-20 23:42:55,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {1836#(exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {1836#(exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)))} is VALID [2022-02-20 23:42:55,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#(exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|)))} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {1846#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:42:55,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base| |#StackHeapBarrier|))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:42:55,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~intINTTYPE4(~i~0, expandArray_~b~0#1.base, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), 4bv32); srcloc: L520 {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:42:55,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~b~0#1.base, expandArray_~b~0#1.offset; {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:42:55,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} assume !~bvslt32(~newsize~0, ~num~0); {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:42:55,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} assume expandArray_~b~0#1.base != 0bv32 || expandArray_~b~0#1.offset != 0bv32; {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:42:55,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} assume 0bv32 == expandArray_~b~0#1.offset; {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:42:55,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1850#(and (exists ((|ULTIMATE.start_main_~a~1#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~a~1#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_main_~a~1#1.base| |#StackHeapBarrier|))) (bvult |ULTIMATE.start_expandArray_~b~0#1.base| |#StackHeapBarrier|))} assume !~bvult32(expandArray_~b~0#1.base, #StackHeapBarrier); {1825#false} is VALID [2022-02-20 23:42:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:55,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:55,210 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:55,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030135988] [2022-02-20 23:42:55,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030135988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:55,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:55,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:42:55,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464101183] [2022-02-20 23:42:55,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:55,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 23:42:55,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:55,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:55,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:42:55,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:42:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:42:55,241 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:55,285 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 23:42:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:42:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 23:42:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 23:42:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 23:42:55,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 23:42:55,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:55,343 INFO L225 Difference]: With dead ends: 41 [2022-02-20 23:42:55,343 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 23:42:55,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:42:55,344 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:55,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-02-20 23:42:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 23:42:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-02-20 23:42:55,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:55,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.4) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,346 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.4) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,346 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.4) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:55,347 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 23:42:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 23:42:55,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:55,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:55,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.4) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 23:42:55,348 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.4) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 23:42:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:55,348 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-02-20 23:42:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-02-20 23:42:55,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:55,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:55,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:55,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.4) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-02-20 23:42:55,350 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 13 [2022-02-20 23:42:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:55,350 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-02-20 23:42:55,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-02-20 23:42:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:42:55,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:55,351 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:55,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-02-20 23:42:55,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:42:55,557 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash 702991736, now seen corresponding path program 1 times [2022-02-20 23:42:55,558 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:55,558 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412422800] [2022-02-20 23:42:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:55,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:55,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:42:55,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:42:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:55,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:42:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:55,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:55,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {2031#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {2031#true} is VALID [2022-02-20 23:42:55,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {2031#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {2031#true} is VALID [2022-02-20 23:42:55,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {2031#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2031#true} is VALID [2022-02-20 23:42:55,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {2031#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {2031#true} is VALID [2022-02-20 23:42:55,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {2031#true} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {2031#true} is VALID [2022-02-20 23:42:55,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {2031#true} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {2051#(not (= (_ bv0 32) |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|))} is VALID [2022-02-20 23:42:55,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {2051#(not (= (_ bv0 32) |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {2055#(not (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:55,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {2055#(not (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(~i~0, expandArray_~b~0#1.base, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), 4bv32); srcloc: L520 {2055#(not (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:55,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {2055#(not (= |ULTIMATE.start_expandArray_~b~0#1.base| (_ bv0 32)))} expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~b~0#1.base, expandArray_~b~0#1.offset; {2062#(not (= (_ bv0 32) |ULTIMATE.start_expandArray_~a~0#1.base|))} is VALID [2022-02-20 23:42:55,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {2062#(not (= (_ bv0 32) |ULTIMATE.start_expandArray_~a~0#1.base|))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {2066#(not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:42:55,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {2066#(not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| (_ bv0 32)))} assume #Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32;call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1); {2032#false} is VALID [2022-02-20 23:42:55,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {2032#false} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {2032#false} is VALID [2022-02-20 23:42:55,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {2032#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))), #length[expandArray_~b~0#1.base]) && ~bvule32(~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), ~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))))) && ~bvule32(0bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))))); {2032#false} is VALID [2022-02-20 23:42:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:55,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:42:55,692 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:55,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412422800] [2022-02-20 23:42:55,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412422800] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:42:55,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:42:55,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:42:55,692 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863424705] [2022-02-20 23:42:55,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:42:55,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 23:42:55,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:55,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:55,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:42:55,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:42:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:42:55,708 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:55,907 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-02-20 23:42:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:42:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 23:42:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 23:42:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 23:42:55,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-02-20 23:42:55,962 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-20 23:42:55,963 INFO L225 Difference]: With dead ends: 41 [2022-02-20 23:42:55,963 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 23:42:55,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:42:55,963 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 65 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:55,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:42:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 23:42:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-02-20 23:42:55,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:55,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,965 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,965 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:55,965 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-02-20 23:42:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-02-20 23:42:55,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:55,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:55,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 23:42:55,970 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 23:42:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:55,971 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-02-20 23:42:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-02-20 23:42:55,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:55,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:55,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:55,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-02-20 23:42:55,971 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 13 [2022-02-20 23:42:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:55,972 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-02-20 23:42:55,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-20 23:42:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:42:55,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:55,972 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:55,981 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-20 23:42:56,179 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-20 23:42:56,179 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 702993658, now seen corresponding path program 1 times [2022-02-20 23:42:56,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:56,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728310673] [2022-02-20 23:42:56,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:56,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:56,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:56,181 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-20 23:42:56,182 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-20 23:42:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:56,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:42:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:42:56,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:42:56,315 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 8 treesize of output 7 [2022-02-20 23:42:56,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {2237#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {2237#true} is VALID [2022-02-20 23:42:56,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {2237#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {2237#true} is VALID [2022-02-20 23:42:56,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2237#true} is VALID [2022-02-20 23:42:56,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {2237#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {2251#(= ~newsize~0 (_ bv0 32))} is VALID [2022-02-20 23:42:56,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {2251#(= ~newsize~0 (_ bv0 32))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {2255#(= ~newsize~0 (_ bv1 32))} is VALID [2022-02-20 23:42:56,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {2255#(= ~newsize~0 (_ bv1 32))} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {2255#(= ~newsize~0 (_ bv1 32))} is VALID [2022-02-20 23:42:56,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {2255#(= ~newsize~0 (_ bv1 32))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {2255#(= ~newsize~0 (_ bv1 32))} is VALID [2022-02-20 23:42:56,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {2255#(= ~newsize~0 (_ bv1 32))} SUMMARY for call write~intINTTYPE4(~i~0, expandArray_~b~0#1.base, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), 4bv32); srcloc: L520 {2255#(= ~newsize~0 (_ bv1 32))} is VALID [2022-02-20 23:42:56,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {2255#(= ~newsize~0 (_ bv1 32))} expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~b~0#1.base, expandArray_~b~0#1.offset; {2255#(= ~newsize~0 (_ bv1 32))} is VALID [2022-02-20 23:42:56,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {2255#(= ~newsize~0 (_ bv1 32))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {2271#(and (= (_ bv2 32) ~newsize~0) (= |ULTIMATE.start_#Ultimate.C_realloc_size#1| (bvmul (_ bv4 32) ~newsize~0)))} is VALID [2022-02-20 23:42:56,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {2271#(and (= (_ bv2 32) ~newsize~0) (= |ULTIMATE.start_#Ultimate.C_realloc_size#1| (bvmul (_ bv4 32) ~newsize~0)))} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {2275#(and (= |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= (_ bv2 32) ~newsize~0))} is VALID [2022-02-20 23:42:56,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {2275#(and (= |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= (_ bv2 32) ~newsize~0))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {2279#(and (= (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= (_ bv2 32) ~newsize~0) (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|))} is VALID [2022-02-20 23:42:56,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {2279#(and (= (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|) (bvmul (_ bv4 32) ~newsize~0)) (= (_ bv2 32) ~newsize~0) (= (_ bv0 32) |ULTIMATE.start_expandArray_~b~0#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))), #length[expandArray_~b~0#1.base]) && ~bvule32(~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), ~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))))) && ~bvule32(0bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))))); {2238#false} is VALID [2022-02-20 23:42:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:56,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:42:56,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {2283#(and (bvule (bvadd (_ bv4294967292 32) |ULTIMATE.start_expandArray_~b~0#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (bvadd |ULTIMATE.start_expandArray_~b~0#1.offset| (bvmul (_ bv4 32) ~newsize~0))) (bvule (bvadd |ULTIMATE.start_expandArray_~b~0#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))), #length[expandArray_~b~0#1.base]) && ~bvule32(~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), ~bvadd32(4bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32)))))) && ~bvule32(0bv32, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))))); {2238#false} is VALID [2022-02-20 23:42:56,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {2287#(and (bvule (bvadd |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (bvule (bvadd (_ bv4294967292 32) |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (bvadd |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (bvmul (_ bv4 32) ~newsize~0))))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {2283#(and (bvule (bvadd (_ bv4294967292 32) |ULTIMATE.start_expandArray_~b~0#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (bvadd |ULTIMATE.start_expandArray_~b~0#1.offset| (bvmul (_ bv4 32) ~newsize~0))) (bvule (bvadd |ULTIMATE.start_expandArray_~b~0#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (select |#length| |ULTIMATE.start_expandArray_~b~0#1.base|)))} is VALID [2022-02-20 23:42:56,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {2291#(and (bvule (bvadd (_ bv4294967292 32) (bvmul (_ bv4 32) ~newsize~0)) (bvmul (_ bv4 32) ~newsize~0)) (bvule (bvmul (_ bv4 32) ~newsize~0) |ULTIMATE.start_#Ultimate.C_realloc_size#1|))} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {2287#(and (bvule (bvadd |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (select |#length| |ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|)) (bvule (bvadd (_ bv4294967292 32) |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (bvmul (_ bv4 32) ~newsize~0)) (bvadd |ULTIMATE.start_#Ultimate.C_realloc_#res#1.offset| (bvmul (_ bv4 32) ~newsize~0))))} is VALID [2022-02-20 23:42:56,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {2291#(and (bvule (bvadd (_ bv4294967292 32) (bvmul (_ bv4 32) ~newsize~0)) (bvmul (_ bv4 32) ~newsize~0)) (bvule (bvmul (_ bv4 32) ~newsize~0) |ULTIMATE.start_#Ultimate.C_realloc_size#1|))} is VALID [2022-02-20 23:42:56,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~b~0#1.base, expandArray_~b~0#1.offset; {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} is VALID [2022-02-20 23:42:56,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} SUMMARY for call write~intINTTYPE4(~i~0, expandArray_~b~0#1.base, ~bvadd32(expandArray_~b~0#1.offset, ~bvmul32(4bv32, ~bvsub32(~newsize~0, 1bv32))), 4bv32); srcloc: L520 {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} is VALID [2022-02-20 23:42:56,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;assume { :end_inline_#Ultimate.C_realloc } true;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset; {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} is VALID [2022-02-20 23:42:56,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} assume !(#Ultimate.C_realloc_ptr#1.base == 0bv32 && #Ultimate.C_realloc_ptr#1.offset == 0bv32);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base)); {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} is VALID [2022-02-20 23:42:56,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {2311#(bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)) (bvadd (_ bv8 32) (bvmul (_ bv4 32) ~newsize~0)))} assume !!~bvslt32(~newsize~0, ~num~0);~newsize~0 := ~bvadd32(1bv32, ~newsize~0);assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := expandArray_~a~0#1.base, expandArray_~a~0#1.offset, ~bvmul32(4bv32, ~newsize~0);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; {2295#(bvule (bvmul (_ bv4 32) ~newsize~0) (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)))} is VALID [2022-02-20 23:42:56,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {2237#true} assume !(main_~a~1#1.base == 0bv32 && main_~a~1#1.offset == 0bv32);~newsize~0 := 0bv32;assume { :begin_inline_expandArray } true;expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset := main_~a~1#1.base, main_~a~1#1.offset;havoc expandArray_#res#1.base, expandArray_#res#1.offset;havoc expandArray_#t~realloc~res2#1.base, expandArray_#t~realloc~res2#1.offset, expandArray_~arg#1.base, expandArray_~arg#1.offset, expandArray_~a~0#1.base, expandArray_~a~0#1.offset, expandArray_~b~0#1.base, expandArray_~b~0#1.offset;expandArray_~arg#1.base, expandArray_~arg#1.offset := expandArray_#in~arg#1.base, expandArray_#in~arg#1.offset;expandArray_~a~0#1.base, expandArray_~a~0#1.offset := expandArray_~arg#1.base, expandArray_~arg#1.offset;expandArray_~b~0#1.base, expandArray_~b~0#1.offset := 0bv32, 0bv32; {2311#(bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) ~newsize~0)) (bvadd (_ bv8 32) (bvmul (_ bv4 32) ~newsize~0)))} is VALID [2022-02-20 23:42:56,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} assume !!(~bvsgt32(~num~0, 0bv32) && ~bvslt32(~num~0, 100bv32));call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32);main_~a~1#1.base, main_~a~1#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2237#true} is VALID [2022-02-20 23:42:56,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {2237#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~ret5#1.base, main_#t~ret5#1.offset, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~a~1#1.base, main_~a~1#1.offset;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;~num~0 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {2237#true} is VALID [2022-02-20 23:42:56,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {2237#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~num~0 := 0bv32;~ind~0 := 0bv32;~newsize~0 := 0bv32;~i~0 := 1bv32; {2237#true} is VALID [2022-02-20 23:42:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:42:56,742 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:42:56,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728310673] [2022-02-20 23:42:56,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728310673] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:42:56,742 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:42:56,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-02-20 23:42:56,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577670104] [2022-02-20 23:42:56,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:42:56,742 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:42:56,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:42:56,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:56,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:56,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:42:56,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:42:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:42:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:42:56,784 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:59,255 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-02-20 23:42:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 23:42:59,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:42:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:42:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2022-02-20 23:42:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 117 transitions. [2022-02-20 23:42:59,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 117 transitions. [2022-02-20 23:42:59,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:42:59,539 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:42:59,539 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:42:59,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:42:59,540 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 384 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:42:59,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 96 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:42:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:42:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 49. [2022-02-20 23:42:59,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:42:59,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,542 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,543 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:59,544 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-02-20 23:42:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-02-20 23:42:59,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:59,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:59,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 112 states. [2022-02-20 23:42:59,545 INFO L87 Difference]: Start difference. First operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 112 states. [2022-02-20 23:42:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:42:59,546 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2022-02-20 23:42:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2022-02-20 23:42:59,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:42:59,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:42:59,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:42:59,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:42:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-02-20 23:42:59,550 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2022-02-20 23:42:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:42:59,550 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-02-20 23:42:59,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:42:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-02-20 23:42:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:42:59,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:42:59,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:42:59,559 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-20 23:42:59,756 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-20 23:42:59,756 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2022-02-20 23:42:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:42:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1949553038, now seen corresponding path program 1 times [2022-02-20 23:42:59,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:42:59,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150971695] [2022-02-20 23:42:59,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:42:59,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:42:59,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:42:59,758 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-20 23:42:59,759 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-20 23:42:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:42:59,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:42:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:42:59,839 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:42:59,839 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:42:59,839 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (8 of 9 remaining) [2022-02-20 23:42:59,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (7 of 9 remaining) [2022-02-20 23:42:59,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (6 of 9 remaining) [2022-02-20 23:42:59,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (5 of 9 remaining) [2022-02-20 23:42:59,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (4 of 9 remaining) [2022-02-20 23:42:59,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (3 of 9 remaining) [2022-02-20 23:42:59,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (2 of 9 remaining) [2022-02-20 23:42:59,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 9 remaining) [2022-02-20 23:42:59,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2022-02-20 23:42:59,851 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-20 23:43:00,041 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-20 23:43:00,044 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:00,046 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:43:00,050 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,051 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,052 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,053 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,054 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,055 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,056 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,056 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,056 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,056 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,056 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,057 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,058 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,058 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,058 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,058 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,058 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,059 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,060 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,069 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:43:00 BoogieIcfgContainer [2022-02-20 23:43:00,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:43:00,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:43:00,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:43:00,089 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:43:00,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:42:49" (3/4) ... [2022-02-20 23:43:00,091 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:43:00,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2022-02-20 23:43:00,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2022-02-20 23:43:00,139 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:43:00,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:43:00,140 INFO L158 Benchmark]: Toolchain (without parser) took 11278.25ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.1MB in the beginning and 55.6MB in the end (delta: -7.5MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-02-20 23:43:00,140 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:43:00,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.82ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 40.6MB in the end (delta: 7.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:43:00,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.58ms. Allocated memory is still 69.2MB. Free memory was 40.6MB in the beginning and 38.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:00,155 INFO L158 Benchmark]: Boogie Preprocessor took 35.56ms. Allocated memory is still 69.2MB. Free memory was 38.4MB in the beginning and 36.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:00,155 INFO L158 Benchmark]: RCFGBuilder took 438.58ms. Allocated memory is still 69.2MB. Free memory was 36.7MB in the beginning and 43.0MB in the end (delta: -6.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 23:43:00,156 INFO L158 Benchmark]: TraceAbstraction took 10331.20ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 42.7MB in the beginning and 64.0MB in the end (delta: -21.3MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2022-02-20 23:43:00,156 INFO L158 Benchmark]: Witness Printer took 50.36ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 55.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:43:00,157 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.16ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 50.0MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.82ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 40.6MB in the end (delta: 7.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.58ms. Allocated memory is still 69.2MB. Free memory was 40.6MB in the beginning and 38.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.56ms. Allocated memory is still 69.2MB. Free memory was 38.4MB in the beginning and 36.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.58ms. Allocated memory is still 69.2MB. Free memory was 36.7MB in the beginning and 43.0MB in the end (delta: -6.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10331.20ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 42.7MB in the beginning and 64.0MB in the end (delta: -21.3MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 50.36ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 55.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 538]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L512] int num; [L513] int ind, newsize, i = 1; VAL [i=1, ind=0, newsize=0, num=0] [L528] num = __VERIFIER_nondet_int() [L529] COND FALSE !(!(num > 0 && num < 100)) [L532] int *a = (int *)malloc(sizeof(int)); [L533] COND FALSE !(a == ((void *)0)) [L536] newsize = 0 [L537] CALL expandArray(a) [L515] int *a = (int *)arg; [L516] int *b = ((void *)0); VAL [a={1:0}, arg={1:0}, arg={1:0}, b={0:0}, i=1, ind=0, newsize=0, num=1] [L517] COND TRUE newsize < num [L518] newsize = newsize + 1 [L519] EXPR, FCALL realloc(a, sizeof(int) * newsize) [L519] b = realloc(a, sizeof(int) * newsize) [L520] b[newsize - 1] = i VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L521] a = b VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L517] COND FALSE !(newsize < num) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L523] COND TRUE b != ((void *)0) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) [L525] return 0; VAL [\result={0:0}, a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L537] RET expandArray(a) [L538] free(a) VAL [\old(argc)=5, a={1:0}, argc=5, argv={7:6}, argv={7:6}, i=1, ind=0, newsize=1, num=1] [L538] free(a) VAL [\old(argc)=5, a={1:0}, argc=5, argv={7:6}, argv={7:6}, i=1, ind=0, newsize=1, num=1] [L538] free(a) VAL [\old(argc)=5, a={1:0}, argc=5, argv={7:6}, argv={7:6}, i=1, ind=0, newsize=1, num=1] - UnprovableResult [Line: 520]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 520]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 776 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 776 mSDsluCounter, 634 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 16 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 322 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=13, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 151 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 120 ConstructedInterpolants, 10 QuantifiedInterpolants, 550 SizeOfPredicates, 19 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 5/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 23:43:00,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)