./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/lis_unsafe.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/lis_unsafe.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 302a384d858b88c7c93de8a2b1030a1c448a13b5bf510dfc42e11e1c01d4bd66 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:40:23,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:40:23,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:40:23,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:40:23,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:40:23,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:40:23,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:40:23,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:40:23,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:40:23,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:40:23,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:40:23,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:40:23,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:40:23,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:40:23,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:40:23,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:40:23,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:40:23,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:40:23,836 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:40:23,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:40:23,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:40:23,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:40:23,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:40:23,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:40:23,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:40:23,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:40:23,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:40:23,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:40:23,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:40:23,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:40:23,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:40:23,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:40:23,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:40:23,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:40:23,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:40:23,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:40:23,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:40:23,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:40:23,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:40:23,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:40:23,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:40:23,871 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:40:23,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:40:23,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:40:23,908 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:40:23,909 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:40:23,909 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:40:23,909 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:40:23,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:40:23,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:40:23,910 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:40:23,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:40:23,911 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:40:23,911 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:40:23,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:40:23,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:40:23,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:40:23,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:40:23,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:40:23,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:40:23,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:23,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:40:23,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:40:23,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:40:23,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:40:23,914 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 -> 302a384d858b88c7c93de8a2b1030a1c448a13b5bf510dfc42e11e1c01d4bd66 [2022-02-20 23:40:24,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:40:24,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:40:24,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:40:24,218 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:40:24,219 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:40:24,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis_unsafe.i [2022-02-20 23:40:24,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca4d9442/42959ef2c1d244eb9547aec5c85bf875/FLAG183bd365f [2022-02-20 23:40:24,667 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:40:24,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis_unsafe.i [2022-02-20 23:40:24,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca4d9442/42959ef2c1d244eb9547aec5c85bf875/FLAG183bd365f [2022-02-20 23:40:24,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca4d9442/42959ef2c1d244eb9547aec5c85bf875 [2022-02-20 23:40:24,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:40:24,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:40:24,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:24,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:40:24,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:40:24,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:24" (1/1) ... [2022-02-20 23:40:24,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641b5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:24, skipping insertion in model container [2022-02-20 23:40:24,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:24" (1/1) ... [2022-02-20 23:40:24,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:40:24,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:24,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:24,973 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:40:24,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@43a1ac61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:24, skipping insertion in model container [2022-02-20 23:40:24,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:24,975 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:40:24,977 INFO L158 Benchmark]: Toolchain (without parser) took 288.88ms. Allocated memory is still 96.5MB. Free memory was 59.3MB in the beginning and 69.8MB in the end (delta: -10.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:40:24,978 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 76.9MB in the beginning and 76.8MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:40:24,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.78ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 70.1MB in the end (delta: -11.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:40:24,980 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 96.5MB. Free memory was 76.9MB in the beginning and 76.8MB in the end (delta: 49.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.78ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 70.1MB in the end (delta: -11.0MB). 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/lis_unsafe.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 302a384d858b88c7c93de8a2b1030a1c448a13b5bf510dfc42e11e1c01d4bd66 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:40:26,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:40:26,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:40:26,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:40:26,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:40:26,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:40:26,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:40:26,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:40:26,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:40:26,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:40:26,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:40:26,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:40:26,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:40:26,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:40:26,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:40:26,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:40:26,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:40:26,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:40:26,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:40:26,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:40:26,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:40:26,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:40:26,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:40:26,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:40:26,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:40:26,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:40:26,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:40:26,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:40:26,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:40:26,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:40:26,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:40:26,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:40:26,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:40:26,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:40:26,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:40:26,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:40:26,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:40:26,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:40:26,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:40:26,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:40:26,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:40:26,709 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:40:26,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:40:26,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:40:26,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:40:26,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:40:26,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:40:26,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:40:26,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:40:26,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:40:26,749 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:40:26,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:40:26,750 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:40:26,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:40:26,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:40:26,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:40:26,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:40:26,750 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:40:26,750 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:40:26,751 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:40:26,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:40:26,751 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:40:26,751 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:40:26,751 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:40:26,751 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:40:26,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:40:26,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:40:26,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:40:26,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:40:26,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:26,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:40:26,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:40:26,753 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:40:26,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:40:26,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:40:26,753 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 -> 302a384d858b88c7c93de8a2b1030a1c448a13b5bf510dfc42e11e1c01d4bd66 [2022-02-20 23:40:27,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:40:27,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:40:27,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:40:27,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:40:27,130 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:40:27,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis_unsafe.i [2022-02-20 23:40:27,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92b08eb5/a2cd807ce6684920959eeafdd6d93a61/FLAG707f26939 [2022-02-20 23:40:27,641 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:40:27,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis_unsafe.i [2022-02-20 23:40:27,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92b08eb5/a2cd807ce6684920959eeafdd6d93a61/FLAG707f26939 [2022-02-20 23:40:27,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92b08eb5/a2cd807ce6684920959eeafdd6d93a61 [2022-02-20 23:40:27,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:40:27,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:40:27,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:27,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:40:27,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:40:27,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:27,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab8c6fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27, skipping insertion in model container [2022-02-20 23:40:27,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:27,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:40:27,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:27,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:27,988 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:40:27,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:28,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:28,017 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:40:28,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:28,081 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:40:28,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28 WrapperNode [2022-02-20 23:40:28,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:28,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:28,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:40:28,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:40:28,087 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:40:28" (1/1) ... [2022-02-20 23:40:28,107 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:40:28" (1/1) ... [2022-02-20 23:40:28,133 INFO L137 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2022-02-20 23:40:28,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:28,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:40:28,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:40:28,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:40:28,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:40:28,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:40:28,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:40:28,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:40:28,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (1/1) ... [2022-02-20 23:40:28,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:28,216 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:40:28,232 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:40:28,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:40:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:40:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:40:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:40:28,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:40:28,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:40:28,321 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:40:28,323 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:40:28,787 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:40:28,792 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:40:28,792 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:40:28,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:28 BoogieIcfgContainer [2022-02-20 23:40:28,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:40:28,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:40:28,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:40:28,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:40:28,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:40:27" (1/3) ... [2022-02-20 23:40:28,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578c2bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:28, skipping insertion in model container [2022-02-20 23:40:28,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:28" (2/3) ... [2022-02-20 23:40:28,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578c2bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:28, skipping insertion in model container [2022-02-20 23:40:28,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:28" (3/3) ... [2022-02-20 23:40:28,803 INFO L111 eAbstractionObserver]: Analyzing ICFG lis_unsafe.i [2022-02-20 23:40:28,807 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:40:28,807 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-02-20 23:40:28,834 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:40:28,839 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:40:28,840 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-02-20 23:40:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 2.0) internal successors, (82), 70 states have internal predecessors, (82), 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:40:28,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:40:28,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:28,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:40:28,857 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:40:28,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:28,865 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-02-20 23:40:28,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:28,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939801049] [2022-02-20 23:40:28,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:28,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:28,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:28,877 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:40:28,878 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:40:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:28,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:40:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:28,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:29,008 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:40:29,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-02-20 23:40:29,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {74#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {74#true} is VALID [2022-02-20 23:40:29,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_~a~0#1.base, main_~a~0#1.offset, main_~N~0#1;havoc main_~a~0#1.base, main_~a~0#1.offset;main_~N~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {74#true} is VALID [2022-02-20 23:40:29,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {74#true} assume ~bvslt32(main_~N~0#1, 1bv32);main_~N~0#1 := 1bv32; {74#true} is VALID [2022-02-20 23:40:29,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {74#true} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~N~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;havoc lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {88#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:40:29,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {88#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {88#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:40:29,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {88#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[lis_~best~0#1.base]); {75#false} is VALID [2022-02-20 23:40:29,053 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:40:29,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:29,054 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:29,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939801049] [2022-02-20 23:40:29,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939801049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:29,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:29,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:29,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998479813] [2022-02-20 23:40:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:40:29,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:29,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:29,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:29,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:29,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:29,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:29,091 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 2.0) internal successors, (82), 70 states have internal predecessors, (82), 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:29,399 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-02-20 23:40:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:40:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 23:40:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 23:40:29,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-02-20 23:40:29,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:29,514 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:40:29,515 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 23:40:29,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:40:29,517 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:29,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 23:40:29,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-20 23:40:29,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:29,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 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:40:29,537 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 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:40:29,537 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 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:40:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:29,542 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-02-20 23:40:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-02-20 23:40:29,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:29,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:29,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 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 61 states. [2022-02-20 23:40:29,544 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 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 61 states. [2022-02-20 23:40:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:29,548 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-02-20 23:40:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-02-20 23:40:29,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:29,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:29,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:29,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.7) internal successors, (68), 60 states have internal predecessors, (68), 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:40:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-02-20 23:40:29,554 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 6 [2022-02-20 23:40:29,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:29,554 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-02-20 23:40:29,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:29,555 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-02-20 23:40:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:40:29,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:29,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:40:29,592 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:40:29,793 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:40:29,793 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:40:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2022-02-20 23:40:29,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:29,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232699336] [2022-02-20 23:40:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:29,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:29,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:29,798 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:40:29,800 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:40:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:29,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:40:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:29,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:29,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:40:29,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:40:29,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:40:29,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {340#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {340#true} is VALID [2022-02-20 23:40:29,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_~a~0#1.base, main_~a~0#1.offset, main_~N~0#1;havoc main_~a~0#1.base, main_~a~0#1.offset;main_~N~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {340#true} is VALID [2022-02-20 23:40:29,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume ~bvslt32(main_~N~0#1, 1bv32);main_~N~0#1 := 1bv32; {351#(= |ULTIMATE.start_main_~N~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:29,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {351#(= |ULTIMATE.start_main_~N~0#1| (_ bv1 32))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~N~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnHeap(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;havoc lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {355#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:29,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {355#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {355#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:29,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {355#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {341#false} is VALID [2022-02-20 23:40:29,997 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:40:29,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:29,998 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:29,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232699336] [2022-02-20 23:40:29,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232699336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:29,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:29,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:29,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75610718] [2022-02-20 23:40:29,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:40:30,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:30,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:30,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:30,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:30,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:30,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:30,011 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:30,623 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:40:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:30,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:40:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-02-20 23:40:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-02-20 23:40:30,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-02-20 23:40:30,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:30,854 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:40:30,854 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:40:30,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:30,855 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:30,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:40:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 64. [2022-02-20 23:40:30,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:30,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 64 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 63 states have internal predecessors, (72), 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:40:30,868 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 64 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 63 states have internal predecessors, (72), 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:40:30,869 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 64 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 63 states have internal predecessors, (72), 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:40:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:30,873 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:40:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-02-20 23:40:30,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:30,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:30,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 63 states have internal predecessors, (72), 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 126 states. [2022-02-20 23:40:30,875 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 63 states have internal predecessors, (72), 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 126 states. [2022-02-20 23:40:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:30,878 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2022-02-20 23:40:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-02-20 23:40:30,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:30,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:30,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:30,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 63 states have internal predecessors, (72), 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:40:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-02-20 23:40:30,881 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 6 [2022-02-20 23:40:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:30,881 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-02-20 23:40:30,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:40:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 23:40:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:40:30,882 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:30,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:40:30,908 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:40:31,111 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:40:31,112 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 25 more)] === [2022-02-20 23:40:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-02-20 23:40:31,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:31,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615105948] [2022-02-20 23:40:31,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:31,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:31,131 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:40:31,150 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:40:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:40:31,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:40:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:40:31,235 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:40:31,251 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:40:31,252 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION (28 of 29 remaining) [2022-02-20 23:40:31,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (27 of 29 remaining) [2022-02-20 23:40:31,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (26 of 29 remaining) [2022-02-20 23:40:31,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (25 of 29 remaining) [2022-02-20 23:40:31,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (24 of 29 remaining) [2022-02-20 23:40:31,254 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (23 of 29 remaining) [2022-02-20 23:40:31,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (22 of 29 remaining) [2022-02-20 23:40:31,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (21 of 29 remaining) [2022-02-20 23:40:31,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (20 of 29 remaining) [2022-02-20 23:40:31,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (19 of 29 remaining) [2022-02-20 23:40:31,255 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (18 of 29 remaining) [2022-02-20 23:40:31,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (17 of 29 remaining) [2022-02-20 23:40:31,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (16 of 29 remaining) [2022-02-20 23:40:31,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (15 of 29 remaining) [2022-02-20 23:40:31,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (14 of 29 remaining) [2022-02-20 23:40:31,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (13 of 29 remaining) [2022-02-20 23:40:31,256 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (12 of 29 remaining) [2022-02-20 23:40:31,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (11 of 29 remaining) [2022-02-20 23:40:31,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (10 of 29 remaining) [2022-02-20 23:40:31,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (9 of 29 remaining) [2022-02-20 23:40:31,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (8 of 29 remaining) [2022-02-20 23:40:31,257 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (7 of 29 remaining) [2022-02-20 23:40:31,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (6 of 29 remaining) [2022-02-20 23:40:31,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (5 of 29 remaining) [2022-02-20 23:40:31,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (4 of 29 remaining) [2022-02-20 23:40:31,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (3 of 29 remaining) [2022-02-20 23:40:31,258 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE (2 of 29 remaining) [2022-02-20 23:40:31,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (1 of 29 remaining) [2022-02-20 23:40:31,259 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (0 of 29 remaining) [2022-02-20 23:40:31,279 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:40:31,487 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:40:31,490 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 23:40:31,492 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:40:31,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:40:31 BoogieIcfgContainer [2022-02-20 23:40:31,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:40:31,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:40:31,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:40:31,505 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:40:31,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:28" (3/4) ... [2022-02-20 23:40:31,506 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:40:31,526 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:40:31,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:40:31,527 INFO L158 Benchmark]: Toolchain (without parser) took 3854.39ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 43.5MB in the beginning and 30.9MB in the end (delta: 12.6MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2022-02-20 23:40:31,527 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 48.2MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:40:31,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.11ms. Allocated memory is still 69.2MB. Free memory was 43.3MB in the beginning and 39.9MB in the end (delta: 3.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:31,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.46ms. Allocated memory is still 69.2MB. Free memory was 39.9MB in the beginning and 37.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:31,528 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 69.2MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:31,532 INFO L158 Benchmark]: RCFGBuilder took 621.06ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 31.9MB in the end (delta: 3.6MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-02-20 23:40:31,532 INFO L158 Benchmark]: TraceAbstraction took 2710.62ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 31.3MB in the beginning and 33.0MB in the end (delta: -1.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-02-20 23:40:31,533 INFO L158 Benchmark]: Witness Printer took 21.04ms. Allocated memory is still 90.2MB. Free memory was 33.0MB in the beginning and 30.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:40:31,534 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 48.2MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.11ms. Allocated memory is still 69.2MB. Free memory was 43.3MB in the beginning and 39.9MB in the end (delta: 3.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.46ms. Allocated memory is still 69.2MB. Free memory was 39.9MB in the beginning and 37.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 69.2MB. Free memory was 37.5MB in the beginning and 35.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 621.06ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 31.9MB in the end (delta: 3.6MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2710.62ms. Allocated memory was 69.2MB in the beginning and 90.2MB in the end (delta: 21.0MB). Free memory was 31.3MB in the beginning and 33.0MB in the end (delta: -1.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Witness Printer took 21.04ms. Allocated memory is still 90.2MB. Free memory was 33.0MB in the beginning and 30.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 518]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L531] int *a; [L532] int N = __VERIFIER_nondet_int(); [L533] COND FALSE !(N < 1) VAL [N=1073741824] [L535] CALL lis(a, N) [L514] int *best, *prev, i, j, max = 0; [L515] best = (int*) malloc(sizeof(int) * N) [L516] prev = (int*) malloc(sizeof(int) * N) [L517] i = 0 VAL [\old(N)=1073741824, a={6:5}, a={6:5}, best={1:0}, i=0, max=0, N=1073741824, prev={2:0}] [L517] COND TRUE i < N VAL [\old(N)=1073741824, a={6:5}, a={6:5}, best={1:0}, i=0, max=0, N=1073741824, prev={2:0}] [L518] best[i] = 1 - UnprovableResult [Line: 518]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 518]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 518]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 521]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 522]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 522]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 522]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 522]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 522]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 522]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 525]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 526]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 526]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 526]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 530]: 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, 71 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 107 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 62 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 5 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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:40:31,577 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-deref)