./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:29,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:29,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:29,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:29,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:29,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:29,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:29,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:29,851 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:29,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:29,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:29,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:29,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:29,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:29,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:29,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:29,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:29,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:29,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:29,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:29,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:29,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:29,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:29,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:29,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:29,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:29,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:29,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:29,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:29,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:29,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:29,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:29,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:29,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:29,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:29,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:29,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:29,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:29,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:29,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:29,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:29,893 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:47:29,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:29,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:29,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:29,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:29,922 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:29,922 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:29,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:29,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:29,923 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:29,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:29,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:29,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:29,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:29,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:29,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:29,924 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:29,925 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:29,925 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:29,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:29,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:29,925 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:29,925 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:29,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:29,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:29,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:29,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:29,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:29,926 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:29,926 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:47:29,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:47:29,927 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2022-02-20 23:47:30,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:30,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:30,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:30,155 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:30,155 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:30,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-02-20 23:47:30,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967c43871/300322233c284b24a00d3c4ec941fef8/FLAG0cea28024 [2022-02-20 23:47:30,553 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:30,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-02-20 23:47:30,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967c43871/300322233c284b24a00d3c4ec941fef8/FLAG0cea28024 [2022-02-20 23:47:30,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967c43871/300322233c284b24a00d3c4ec941fef8 [2022-02-20 23:47:30,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:30,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:30,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:30,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:30,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:30,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:30" (1/1) ... [2022-02-20 23:47:30,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0d9988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:30, skipping insertion in model container [2022-02-20 23:47:30,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:30" (1/1) ... [2022-02-20 23:47:30,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:30,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:31,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:31,226 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:47:31,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25462da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:31, skipping insertion in model container [2022-02-20 23:47:31,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:31,227 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:47:31,228 INFO L158 Benchmark]: Toolchain (without parser) took 284.10ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 74.0MB in the end (delta: -5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:31,229 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 55.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:47:31,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.98ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 74.0MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:31,230 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 55.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.98ms. Allocated memory is still 100.7MB. Free memory was 67.8MB in the beginning and 74.0MB in the end (delta: -6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: 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/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:32,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:32,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:32,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:32,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:32,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:32,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:32,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:32,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:32,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:32,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:32,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:32,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:32,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:32,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:32,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:32,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:32,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:32,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:32,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:33,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:33,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:33,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:33,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:33,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:33,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:33,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:33,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:33,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:33,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:33,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:33,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:33,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:33,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:33,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:33,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:33,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:33,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:33,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:33,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:33,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:33,034 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:47:33,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:33,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:33,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:33,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:33,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:33,080 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:33,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:33,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:33,081 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:33,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:33,082 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:33,082 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:33,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:33,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:47:33,083 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:47:33,084 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:33,084 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:33,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:33,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:33,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:33,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:33,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:33,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:33,085 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:47:33,085 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:47:33,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:47:33,085 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2022-02-20 23:47:33,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:33,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:33,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:33,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:33,420 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:33,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-02-20 23:47:33,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf557a9d/a1272d77ac394d0fb865bb68dcda9a82/FLAG39108518d [2022-02-20 23:47:33,944 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:33,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-02-20 23:47:33,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf557a9d/a1272d77ac394d0fb865bb68dcda9a82/FLAG39108518d [2022-02-20 23:47:33,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf557a9d/a1272d77ac394d0fb865bb68dcda9a82 [2022-02-20 23:47:33,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:33,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:33,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:33,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:33,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:33,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:33" (1/1) ... [2022-02-20 23:47:33,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23024f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:33, skipping insertion in model container [2022-02-20 23:47:33,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:33" (1/1) ... [2022-02-20 23:47:33,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:34,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:34,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:34,284 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:47:34,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:34,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:34,320 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:47:34,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:34,370 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:47:34,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34 WrapperNode [2022-02-20 23:47:34,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:34,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:34,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:47:34,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:47:34,376 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:47:34" (1/1) ... [2022-02-20 23:47:34,390 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:47:34" (1/1) ... [2022-02-20 23:47:34,421 INFO L137 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-02-20 23:47:34,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:34,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:47:34,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:47:34,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:47:34,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:47:34,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:47:34,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:47:34,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:47:34,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (1/1) ... [2022-02-20 23:47:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:34,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:34,521 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:47:34,543 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:47:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:47:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:47:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:47:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:47:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:47:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:47:34,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:47:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:47:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:47:34,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:47:34,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:47:34,629 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:47:34,631 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:35,042 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:35,048 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:35,048 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:47:35,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:35 BoogieIcfgContainer [2022-02-20 23:47:35,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:35,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:35,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:35,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:35,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:47:33" (1/3) ... [2022-02-20 23:47:35,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ea44d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:35, skipping insertion in model container [2022-02-20 23:47:35,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:34" (2/3) ... [2022-02-20 23:47:35,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ea44d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:35, skipping insertion in model container [2022-02-20 23:47:35,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:35" (3/3) ... [2022-02-20 23:47:35,058 INFO L111 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2022-02-20 23:47:35,062 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:35,062 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-02-20 23:47:35,103 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:35,109 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:47:35,109 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-02-20 23:47:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 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:47:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:35,128 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:35,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:35,130 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-02-20 23:47:35,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:35,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391880584] [2022-02-20 23:47:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:35,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:35,160 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:47:35,161 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:47:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:35,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:35,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:35,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:35,361 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:35,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:47:35,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {101#true} is VALID [2022-02-20 23:47:35,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {109#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:35,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {109#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {113#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:35,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[append_~pointerToList#1.base]); {102#false} is VALID [2022-02-20 23:47:35,394 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:47:35,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:35,394 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:35,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391880584] [2022-02-20 23:47:35,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391880584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:35,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:35,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:35,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769304247] [2022-02-20 23:47:35,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:35,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:35,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:35,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:35,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:35,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:35,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:35,435 INFO L87 Difference]: Start difference. First operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:35,940 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-02-20 23:47:35,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:35,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-02-20 23:47:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-02-20 23:47:35,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-02-20 23:47:36,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:36,196 INFO L225 Difference]: With dead ends: 148 [2022-02-20 23:47:36,196 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 23:47:36,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:47:36,201 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:36,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:36,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 23:47:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2022-02-20 23:47:36,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:36,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 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:47:36,236 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 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:47:36,237 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 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:47:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:36,245 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-02-20 23:47:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2022-02-20 23:47:36,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:36,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:36,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 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 146 states. [2022-02-20 23:47:36,247 INFO L87 Difference]: Start difference. First operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 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 146 states. [2022-02-20 23:47:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:36,254 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-02-20 23:47:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2022-02-20 23:47:36,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:36,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:36,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:36,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:36,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 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:47:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-02-20 23:47:36,265 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2022-02-20 23:47:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:36,266 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-02-20 23:47:36,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-02-20 23:47:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:36,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:36,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:36,280 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:47:36,477 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:47:36,477 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-02-20 23:47:36,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:36,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475127682] [2022-02-20 23:47:36,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:36,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:36,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:36,480 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:47:36,481 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:47:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:36,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:36,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:36,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:36,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:36,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:36,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:47:36,642 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:36,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:47:36,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {651#true} is VALID [2022-02-20 23:47:36,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {659#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:47:36,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {663#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:36,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {663#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, append_~pointerToList#1.offset), #length[append_~pointerToList#1.base]) && ~bvule32(append_~pointerToList#1.offset, ~bvadd32(4bv32, append_~pointerToList#1.offset))) && ~bvule32(0bv32, append_~pointerToList#1.offset)); {652#false} is VALID [2022-02-20 23:47:36,665 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:47:36,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:36,665 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:36,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475127682] [2022-02-20 23:47:36,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475127682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:36,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:36,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:36,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843319080] [2022-02-20 23:47:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:36,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:36,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:36,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:36,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:36,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:36,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:36,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:36,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:36,674 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:37,478 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-02-20 23:47:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:37,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:47:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 23:47:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 23:47:37,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 257 transitions. [2022-02-20 23:47:37,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:37,744 INFO L225 Difference]: With dead ends: 236 [2022-02-20 23:47:37,744 INFO L226 Difference]: Without dead ends: 236 [2022-02-20 23:47:37,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:47:37,746 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 235 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:37,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 97 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-20 23:47:37,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2022-02-20 23:47:37,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:37,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 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:47:37,751 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 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:47:37,752 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 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:47:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:37,757 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-02-20 23:47:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 253 transitions. [2022-02-20 23:47:37,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:37,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:37,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 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 236 states. [2022-02-20 23:47:37,759 INFO L87 Difference]: Start difference. First operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 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 236 states. [2022-02-20 23:47:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:37,765 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-02-20 23:47:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 253 transitions. [2022-02-20 23:47:37,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:37,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:37,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:37,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 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:47:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2022-02-20 23:47:37,768 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2022-02-20 23:47:37,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:37,768 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2022-02-20 23:47:37,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2022-02-20 23:47:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:37,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:37,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:37,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:47:37,975 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:47:37,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:37,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:37,976 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-02-20 23:47:37,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:37,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375889994] [2022-02-20 23:47:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:37,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:37,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:37,979 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:47:37,981 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:47:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:38,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:38,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {1483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {1483#true} is VALID [2022-02-20 23:47:38,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {1483#true} is VALID [2022-02-20 23:47:38,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {1494#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:38,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {1494#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {1494#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:38,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {1494#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {1484#false} is VALID [2022-02-20 23:47:38,072 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:47:38,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:38,072 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:38,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375889994] [2022-02-20 23:47:38,073 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375889994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:38,073 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:38,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:38,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712044218] [2022-02-20 23:47:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:38,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:38,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:38,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:38,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:38,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:38,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:38,083 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:38,403 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-02-20 23:47:38,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:38,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:38,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2022-02-20 23:47:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2022-02-20 23:47:38,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 141 transitions. [2022-02-20 23:47:38,538 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:47:38,542 INFO L225 Difference]: With dead ends: 136 [2022-02-20 23:47:38,542 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 23:47:38,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:38,543 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:38,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 87 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 23:47:38,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-02-20 23:47:38,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:38,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 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:47:38,550 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 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:47:38,551 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 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:47:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:38,555 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-02-20 23:47:38,555 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-02-20 23:47:38,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:38,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:38,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 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 136 states. [2022-02-20 23:47:38,556 INFO L87 Difference]: Start difference. First operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 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 136 states. [2022-02-20 23:47:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:38,560 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-02-20 23:47:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2022-02-20 23:47:38,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:38,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:38,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:38,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 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:47:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-02-20 23:47:38,564 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2022-02-20 23:47:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:38,567 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-02-20 23:47:38,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-02-20 23:47:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:38,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:38,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:38,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:47:38,773 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:47:38,774 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:38,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-02-20 23:47:38,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:38,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717155786] [2022-02-20 23:47:38,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:38,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:38,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:38,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:47:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:38,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:38,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {2013#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {2013#true} is VALID [2022-02-20 23:47:38,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {2013#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {2013#true} is VALID [2022-02-20 23:47:38,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2013#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {2024#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:38,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {2024#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {2024#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:38,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {2024#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, append_~node~0#1.offset)), #length[append_~node~0#1.base]) && ~bvule32(~bvadd32(4bv32, append_~node~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, append_~node~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, append_~node~0#1.offset))); {2014#false} is VALID [2022-02-20 23:47:38,869 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:47:38,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:38,870 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:38,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717155786] [2022-02-20 23:47:38,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717155786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:38,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:38,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:38,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066196113] [2022-02-20 23:47:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:38,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:38,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:38,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:38,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:38,884 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:39,244 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-02-20 23:47:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-20 23:47:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-20 23:47:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-20 23:47:39,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2022-02-20 23:47:39,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:39,363 INFO L225 Difference]: With dead ends: 180 [2022-02-20 23:47:39,363 INFO L226 Difference]: Without dead ends: 180 [2022-02-20 23:47:39,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:39,364 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:39,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-20 23:47:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2022-02-20 23:47:39,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:39,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 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:47:39,370 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 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:47:39,370 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 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:47:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:39,373 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-02-20 23:47:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2022-02-20 23:47:39,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:39,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:39,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 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 180 states. [2022-02-20 23:47:39,375 INFO L87 Difference]: Start difference. First operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 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 180 states. [2022-02-20 23:47:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:39,378 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-02-20 23:47:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2022-02-20 23:47:39,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:39,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:39,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:39,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 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:47:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-02-20 23:47:39,380 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2022-02-20 23:47:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:39,380 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-02-20 23:47:39,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-02-20 23:47:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:47:39,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:39,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:39,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:39,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:39,589 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:39,590 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2022-02-20 23:47:39,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:39,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045266162] [2022-02-20 23:47:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:39,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:39,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:47:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:39,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:47:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:39,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:39,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:39,745 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:39,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:47:39,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {2678#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {2678#true} is VALID [2022-02-20 23:47:39,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {2678#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {2678#true} is VALID [2022-02-20 23:47:39,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {2678#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {2678#true} is VALID [2022-02-20 23:47:39,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {2678#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {2678#true} is VALID [2022-02-20 23:47:39,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {2678#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {2678#true} is VALID [2022-02-20 23:47:39,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {2678#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {2678#true} is VALID [2022-02-20 23:47:39,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {2678#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {2701#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} is VALID [2022-02-20 23:47:39,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {2701#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {2701#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} is VALID [2022-02-20 23:47:39,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {2701#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} assume !(1bv1 == #valid[create_data_~data~0#1.base]); {2679#false} is VALID [2022-02-20 23:47:39,766 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:47:39,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:39,766 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:39,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045266162] [2022-02-20 23:47:39,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045266162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:39,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:39,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:39,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213826865] [2022-02-20 23:47:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:39,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:39,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:39,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:39,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:39,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:39,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:39,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:39,777 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,157 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-02-20 23:47:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:40,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:47:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:47:40,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2022-02-20 23:47:40,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:40,300 INFO L225 Difference]: With dead ends: 151 [2022-02-20 23:47:40,300 INFO L226 Difference]: Without dead ends: 151 [2022-02-20 23:47:40,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:40,300 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 69 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:40,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-20 23:47:40,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2022-02-20 23:47:40,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:40,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 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:47:40,304 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 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:47:40,304 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 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:47:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,306 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-02-20 23:47:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2022-02-20 23:47:40,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:40,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:40,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 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 151 states. [2022-02-20 23:47:40,307 INFO L87 Difference]: Start difference. First operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 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 151 states. [2022-02-20 23:47:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,309 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-02-20 23:47:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2022-02-20 23:47:40,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:40,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:40,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:40,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 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:47:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-02-20 23:47:40,311 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2022-02-20 23:47:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:40,312 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-02-20 23:47:40,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-02-20 23:47:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:47:40,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:40,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:40,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:40,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:40,519 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2022-02-20 23:47:40,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:40,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13461156] [2022-02-20 23:47:40,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:40,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:40,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:40,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:40,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:47:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:40,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:47:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:40,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:40,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:40,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:40,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:40,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:47:40,654 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:40,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:47:40,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {3264#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {3264#true} is VALID [2022-02-20 23:47:40,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {3264#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {3264#true} is VALID [2022-02-20 23:47:40,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {3264#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {3264#true} is VALID [2022-02-20 23:47:40,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {3264#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {3264#true} is VALID [2022-02-20 23:47:40,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {3264#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {3264#true} is VALID [2022-02-20 23:47:40,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {3264#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {3264#true} is VALID [2022-02-20 23:47:40,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {3264#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {3287#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (= |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:40,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {3287#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (= |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv0 32)))} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {3291#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (= |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:40,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {3291#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_create_data_~data~0#1.base|)) (= |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, create_data_~data~0#1.offset)), #length[create_data_~data~0#1.base]) && ~bvule32(~bvadd32(4bv32, create_data_~data~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, create_data_~data~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, create_data_~data~0#1.offset))); {3265#false} is VALID [2022-02-20 23:47:40,672 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:47:40,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:40,672 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:40,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13461156] [2022-02-20 23:47:40,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13461156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:40,673 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:40,673 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:40,673 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616922535] [2022-02-20 23:47:40,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:40,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:40,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:47:40,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:40,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:40,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:40,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:40,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:40,684 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,388 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-02-20 23:47:41,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:47:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-02-20 23:47:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-02-20 23:47:41,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 197 transitions. [2022-02-20 23:47:41,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:41,588 INFO L225 Difference]: With dead ends: 200 [2022-02-20 23:47:41,588 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 23:47:41,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:41,589 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 118 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:41,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 193 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 23:47:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2022-02-20 23:47:41,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:41,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 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:47:41,592 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 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:47:41,592 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 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:47:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,595 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-02-20 23:47:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2022-02-20 23:47:41,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:41,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:41,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 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 200 states. [2022-02-20 23:47:41,596 INFO L87 Difference]: Start difference. First operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 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 200 states. [2022-02-20 23:47:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:41,599 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-02-20 23:47:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2022-02-20 23:47:41,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:41,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:41,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:41,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 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:47:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-02-20 23:47:41,602 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2022-02-20 23:47:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:41,602 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-02-20 23:47:41,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:47:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-02-20 23:47:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:41,603 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:41,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:41,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:41,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:41,810 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2022-02-20 23:47:41,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:41,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113635539] [2022-02-20 23:47:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:41,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:41,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:41,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:47:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:41,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:41,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:41,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:41,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:41,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:47:41,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {3994#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {3994#true} is VALID [2022-02-20 23:47:41,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {3994#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {3994#true} is VALID [2022-02-20 23:47:41,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {3994#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {3994#true} is VALID [2022-02-20 23:47:41,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {3994#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {3994#true} is VALID [2022-02-20 23:47:41,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {3994#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {3994#true} is VALID [2022-02-20 23:47:41,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {3994#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {3994#true} is VALID [2022-02-20 23:47:41,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {3994#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {3994#true} is VALID [2022-02-20 23:47:41,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {3994#true} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {4020#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_#t~malloc6#1.base|))} is VALID [2022-02-20 23:47:41,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_#t~malloc6#1.base|))} SUMMARY for call write~$Pointer$(create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L555 {4024#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} is VALID [2022-02-20 23:47:41,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {4024#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} havoc create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset;create_data_~counter~0#1 := 0bv32;create_data_~counter~0#1 := 0bv32; {4024#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} is VALID [2022-02-20 23:47:41,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {4024#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {4024#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} is VALID [2022-02-20 23:47:41,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {4024#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {4034#(= (select |#valid| |ULTIMATE.start_create_data_#t~mem8#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:41,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {4034#(= (select |#valid| |ULTIMATE.start_create_data_#t~mem8#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[create_data_#t~mem8#1.base]); {3995#false} is VALID [2022-02-20 23:47:41,970 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:47:41,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:41,970 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:41,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113635539] [2022-02-20 23:47:41,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113635539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:41,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:41,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:41,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893885528] [2022-02-20 23:47:41,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:41,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:41,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:41,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:41,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:41,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:41,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:41,985 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,792 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-02-20 23:47:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 23:47:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2022-02-20 23:47:42,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2022-02-20 23:47:42,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:42,899 INFO L225 Difference]: With dead ends: 109 [2022-02-20 23:47:42,900 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 23:47:42,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:42,900 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:42,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 216 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 23:47:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-02-20 23:47:42,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:42,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 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:47:42,903 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 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:47:42,903 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 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:47:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,904 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-02-20 23:47:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-02-20 23:47:42,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:42,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:42,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 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 109 states. [2022-02-20 23:47:42,908 INFO L87 Difference]: Start difference. First operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 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 109 states. [2022-02-20 23:47:42,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,910 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-02-20 23:47:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-02-20 23:47:42,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:42,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:42,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:42,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 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:47:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-02-20 23:47:42,913 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2022-02-20 23:47:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:42,913 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-02-20 23:47:42,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-02-20 23:47:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:42,913 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:42,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:42,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:43,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:43,120 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2022-02-20 23:47:43,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:43,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132045933] [2022-02-20 23:47:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:43,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:43,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:43,123 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:43,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:47:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:43,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:43,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:43,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:43,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:43,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:43,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:47:43,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:43,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {4471#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {4471#true} is VALID [2022-02-20 23:47:43,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {4471#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {4471#true} is VALID [2022-02-20 23:47:43,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {4471#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {4471#true} is VALID [2022-02-20 23:47:43,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {4471#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {4471#true} is VALID [2022-02-20 23:47:43,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {4471#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {4471#true} is VALID [2022-02-20 23:47:43,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {4471#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {4471#true} is VALID [2022-02-20 23:47:43,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {4471#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {4471#true} is VALID [2022-02-20 23:47:43,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {4471#true} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {4497#(and (= |ULTIMATE.start_create_data_#t~malloc6#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|) (_ bv80 32)))} is VALID [2022-02-20 23:47:43,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {4497#(and (= |ULTIMATE.start_create_data_#t~malloc6#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|) (_ bv80 32)))} SUMMARY for call write~$Pointer$(create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L555 {4501#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:43,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {4501#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} havoc create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset;create_data_~counter~0#1 := 0bv32;create_data_~counter~0#1 := 0bv32; {4505#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:43,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {4505#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {4505#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:43,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {4505#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {4512#(and (= |ULTIMATE.start_create_data_#t~mem8#1.offset| (_ bv0 32)) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (= (_ bv80 32) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)))} is VALID [2022-02-20 23:47:43,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {4512#(and (= |ULTIMATE.start_create_data_#t~mem8#1.offset| (_ bv0 32)) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (= (_ bv80 32) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))), #length[create_data_#t~mem8#1.base]) && ~bvule32(~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), ~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))))) && ~bvule32(0bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)))); {4472#false} is VALID [2022-02-20 23:47:43,383 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:47:43,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:43,383 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:43,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132045933] [2022-02-20 23:47:43,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132045933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:43,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:43,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:43,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331715891] [2022-02-20 23:47:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:43,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:43,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:43,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:43,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:43,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:43,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:43,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:43,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:43,401 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:44,458 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-02-20 23:47:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-02-20 23:47:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-02-20 23:47:44,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 91 transitions. [2022-02-20 23:47:44,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:44,579 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:47:44,579 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:47:44,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:44,580 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:44,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 262 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:47:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-02-20 23:47:44,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:44,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 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:47:44,582 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 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:47:44,584 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 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:47:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:44,586 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-02-20 23:47:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-02-20 23:47:44,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:44,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:44,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 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 104 states. [2022-02-20 23:47:44,587 INFO L87 Difference]: Start difference. First operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 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 104 states. [2022-02-20 23:47:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:44,602 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-02-20 23:47:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-02-20 23:47:44,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:44,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:44,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:44,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 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:47:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-02-20 23:47:44,604 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2022-02-20 23:47:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:44,604 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-02-20 23:47:44,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-02-20 23:47:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:47:44,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:44,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:44,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:44,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:44,806 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:44,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2022-02-20 23:47:44,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:44,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891113248] [2022-02-20 23:47:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:44,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:44,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:44,808 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:44,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:47:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:44,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:47:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:44,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:45,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:45,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:47:45,028 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:45,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:47:45,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {4934#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {4934#true} is VALID [2022-02-20 23:47:45,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {4934#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {4942#(= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:47:45,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#(= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {4946#(= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:47:45,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {4946#(= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {4950#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {4950#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {4950#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {4950#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {4950#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {4950#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} assume !(0bv32 != create_data_#t~nondet5#1);havoc create_data_#t~nondet5#1; {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L561 {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} SUMMARY for call write~intINTTYPE4(create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset, 4bv32); srcloc: L561-1 {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} havoc create_data_#t~nondet10#1;create_data_#res#1.base, create_data_#res#1.offset := create_data_~data~0#1.base, create_data_~data~0#1.offset; {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;assume { :end_inline_create_data } true; {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4bv32); srcloc: L578 {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:45,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {4960#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~pointerToList#1.offset|) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, append_~pointerToList#1.offset), #length[append_~pointerToList#1.base]) && ~bvule32(append_~pointerToList#1.offset, ~bvadd32(4bv32, append_~pointerToList#1.offset))) && ~bvule32(0bv32, append_~pointerToList#1.offset)); {4935#false} is VALID [2022-02-20 23:47:45,109 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:47:45,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:45,110 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:45,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891113248] [2022-02-20 23:47:45,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891113248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:45,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:45,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:45,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209605091] [2022-02-20 23:47:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-02-20 23:47:45,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:45,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:47:45,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:45,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:45,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:45,130 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:47:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:45,578 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-02-20 23:47:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-02-20 23:47:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:47:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2022-02-20 23:47:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:47:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2022-02-20 23:47:45,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 130 transitions. [2022-02-20 23:47:45,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:45,729 INFO L225 Difference]: With dead ends: 133 [2022-02-20 23:47:45,729 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 23:47:45,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:45,729 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 411 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:45,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 65 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 23:47:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2022-02-20 23:47:45,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:45,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 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:47:45,732 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 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:47:45,732 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 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:47:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:45,733 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-02-20 23:47:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-02-20 23:47:45,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:45,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:45,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 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 133 states. [2022-02-20 23:47:45,746 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 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 133 states. [2022-02-20 23:47:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:45,753 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-02-20 23:47:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-02-20 23:47:45,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:45,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:45,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:45,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 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:47:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-02-20 23:47:45,761 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2022-02-20 23:47:45,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:45,761 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-02-20 23:47:45,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:47:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-02-20 23:47:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:45,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:45,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:45,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:45,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:45,969 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:45,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2022-02-20 23:47:45,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:45,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145560905] [2022-02-20 23:47:45,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:45,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:45,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:45,971 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:45,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:47:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:46,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:47:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:46,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:46,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:47:46,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-02-20 23:47:46,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {5487#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {5487#true} is VALID [2022-02-20 23:47:46,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {5487#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {5487#true} is VALID [2022-02-20 23:47:46,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {5487#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} assume 0bv32 != create_data_#t~nondet3#1;havoc create_data_#t~nondet3#1;create_data_#res#1.base, create_data_#res#1.offset := 0bv32, 0bv32; {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;assume { :end_inline_create_data } true; {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4bv32); srcloc: L578 {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:46,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {5498#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (not (= |ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(append_~node~0#1.base, append_~node~0#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L579 {5523#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:46,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {5523#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} assume { :end_inline_append } true; {5523#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:46,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {5523#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {5523#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:46,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {5523#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L591-1 {5533#(not (= |ULTIMATE.start_main_#t~mem22#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:46,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {5533#(not (= |ULTIMATE.start_main_#t~mem22#1.base| (_ bv0 32)))} assume !(main_#t~mem22#1.base != 0bv32 || main_#t~mem22#1.offset != 0bv32);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {5488#false} is VALID [2022-02-20 23:47:46,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {5488#false} main_#res#1 := 0bv32;call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; {5488#false} is VALID [2022-02-20 23:47:46,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {5488#false} assume !(#valid == main_old_#valid#1); {5488#false} is VALID [2022-02-20 23:47:46,201 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:47:46,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:46,201 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:46,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145560905] [2022-02-20 23:47:46,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145560905] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:46,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:46,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:46,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458974228] [2022-02-20 23:47:46,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:46,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 23:47:46,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:46,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:47:46,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:46,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:46,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:46,223 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:47:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:46,862 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-02-20 23:47:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:46,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 23:47:46,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:47:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-02-20 23:47:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:47:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-02-20 23:47:46,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 135 transitions. [2022-02-20 23:47:47,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:47,006 INFO L225 Difference]: With dead ends: 137 [2022-02-20 23:47:47,006 INFO L226 Difference]: Without dead ends: 137 [2022-02-20 23:47:47,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:47,007 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 164 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:47,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 174 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-20 23:47:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2022-02-20 23:47:47,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:47,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 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:47:47,009 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 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:47:47,009 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 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:47:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:47,010 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-02-20 23:47:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2022-02-20 23:47:47,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:47,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:47,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 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 137 states. [2022-02-20 23:47:47,011 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 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 137 states. [2022-02-20 23:47:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:47,013 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-02-20 23:47:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2022-02-20 23:47:47,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:47,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:47,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:47,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:47,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 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:47:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-02-20 23:47:47,015 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2022-02-20 23:47:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:47,015 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-02-20 23:47:47,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:47:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-02-20 23:47:47,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:47,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:47,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:47,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:47,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:47,223 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:47,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2022-02-20 23:47:47,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:47,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940825596] [2022-02-20 23:47:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:47,225 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:47,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:47:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:47,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:47:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:47,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:47,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:47,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:47:47,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:47:47,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {6055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {6055#true} is VALID [2022-02-20 23:47:47,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {6055#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {6055#true} is VALID [2022-02-20 23:47:47,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {6055#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} assume 0bv32 != create_data_#t~nondet3#1;havoc create_data_#t~nondet3#1;create_data_#res#1.base, create_data_#res#1.offset := 0bv32, 0bv32; {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;assume { :end_inline_create_data } true; {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4bv32); srcloc: L578 {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:47:47,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {6066#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call write~$Pointer$(append_~node~0#1.base, append_~node~0#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L579 {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:47:47,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :end_inline_append } true; {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:47:47,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !(0bv32 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:47:47,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L591-1 {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:47:47,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !!(main_#t~mem22#1.base != 0bv32 || main_#t~mem22#1.offset != 0bv32);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:47:47,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {6091#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L588 {6107#(= (select |#valid| |ULTIMATE.start_main_#t~mem17#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:47,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {6107#(= (select |#valid| |ULTIMATE.start_main_#t~mem17#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem17#1.base]); {6056#false} is VALID [2022-02-20 23:47:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:47,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:47,466 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:47,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940825596] [2022-02-20 23:47:47,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940825596] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:47,466 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:47,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:47,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774377516] [2022-02-20 23:47:47,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:47,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 23:47:47,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:47,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:47,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:47,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:47,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:47,492 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:48,238 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-02-20 23:47:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 23:47:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-02-20 23:47:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-02-20 23:47:48,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 129 transitions. [2022-02-20 23:47:48,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:48,359 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:47:48,359 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:47:48,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:48,359 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:48,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:47:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2022-02-20 23:47:48,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:48,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 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:47:48,361 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 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:47:48,361 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 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:47:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:48,363 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-02-20 23:47:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-02-20 23:47:48,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:48,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:48,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 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 129 states. [2022-02-20 23:47:48,363 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 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 129 states. [2022-02-20 23:47:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:48,365 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-02-20 23:47:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-02-20 23:47:48,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:48,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:48,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:48,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 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:47:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-02-20 23:47:48,366 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2022-02-20 23:47:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:48,366 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-02-20 23:47:48,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-02-20 23:47:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:48,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:48,366 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:48,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:48,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:48,567 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2022-02-20 23:47:48,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:48,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136746926] [2022-02-20 23:47:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:48,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:48,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:48,569 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:48,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:47:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:48,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:47:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:48,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:48,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:48,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:47:48,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:47:48,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:47:48,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:48,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {6599#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {6599#true} is VALID [2022-02-20 23:47:48,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {6599#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {6599#true} is VALID [2022-02-20 23:47:48,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {6599#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume 0bv32 != create_data_#t~nondet3#1;havoc create_data_#t~nondet3#1;create_data_#res#1.base, create_data_#res#1.offset := 0bv32, 0bv32; {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;assume { :end_inline_create_data } true; {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4bv32); srcloc: L578 {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {6610#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_~node~0#1.base, append_~node~0#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L579 {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:47:48,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume { :end_inline_append } true; {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:47:48,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:47:48,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L591-1 {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:47:48,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !!(main_#t~mem22#1.base != 0bv32 || main_#t~mem22#1.offset != 0bv32);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:47:48,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {6635#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L588 {6651#(and (= (select |#length| |ULTIMATE.start_main_#t~mem17#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~mem17#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {6651#(and (= (select |#length| |ULTIMATE.start_main_#t~mem17#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~mem17#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem17#1.offset)), #length[main_#t~mem17#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem17#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem17#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem17#1.offset))); {6600#false} is VALID [2022-02-20 23:47:48,954 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:47:48,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:48,954 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:48,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136746926] [2022-02-20 23:47:48,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136746926] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:48,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:48,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:48,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326313137] [2022-02-20 23:47:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:48,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 23:47:48,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:48,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:48,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:48,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:48,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:48,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:48,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:48,976 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:50,163 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-02-20 23:47:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-02-20 23:47:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2022-02-20 23:47:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2022-02-20 23:47:50,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 194 transitions. [2022-02-20 23:47:50,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:50,379 INFO L225 Difference]: With dead ends: 201 [2022-02-20 23:47:50,379 INFO L226 Difference]: Without dead ends: 201 [2022-02-20 23:47:50,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:50,380 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:50,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 221 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-20 23:47:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2022-02-20 23:47:50,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:50,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 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:47:50,382 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 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:47:50,382 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 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:47:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:50,384 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-02-20 23:47:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 219 transitions. [2022-02-20 23:47:50,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:50,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:50,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 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 201 states. [2022-02-20 23:47:50,390 INFO L87 Difference]: Start difference. First operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 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 201 states. [2022-02-20 23:47:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:50,406 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-02-20 23:47:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 219 transitions. [2022-02-20 23:47:50,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:50,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:50,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:50,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 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:47:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-02-20 23:47:50,409 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2022-02-20 23:47:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:50,409 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-02-20 23:47:50,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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:47:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-02-20 23:47:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:47:50,410 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:50,410 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:50,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:50,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:50,617 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2022-02-20 23:47:50,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:50,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243487797] [2022-02-20 23:47:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:50,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:50,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:50,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:50,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:47:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:50,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:50,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:50,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:50,840 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:47:50,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:47:50,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:47:51,068 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:51,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-02-20 23:47:51,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-02-20 23:47:51,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {7367#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {7367#true} is VALID [2022-02-20 23:47:51,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {7367#true} is VALID [2022-02-20 23:47:51,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {7367#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {7367#true} is VALID [2022-02-20 23:47:51,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {7367#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {7367#true} is VALID [2022-02-20 23:47:51,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {7367#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {7367#true} is VALID [2022-02-20 23:47:51,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {7367#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {7367#true} is VALID [2022-02-20 23:47:51,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {7367#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {7390#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} is VALID [2022-02-20 23:47:51,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {7390#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {7394#(and (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_#t~malloc6#1.base|)))} is VALID [2022-02-20 23:47:51,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {7394#(and (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_#t~malloc6#1.base|)))} SUMMARY for call write~$Pointer$(create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L555 {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} havoc create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset;create_data_~counter~0#1 := 0bv32;create_data_~counter~0#1 := 0bv32; {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {7408#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} is VALID [2022-02-20 23:47:51,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {7408#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} SUMMARY for call write~intINTTYPE4(create_data_#t~nondet9#1, create_data_#t~mem8#1.base, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), 4bv32); srcloc: L558-1 {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} havoc create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset;havoc create_data_#t~nondet9#1; {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} create_data_#t~post7#1 := create_data_~counter~0#1;create_data_~counter~0#1 := ~bvadd32(1bv32, create_data_#t~post7#1);havoc create_data_#t~post7#1; {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {7398#(and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {7424#(and (exists ((|ULTIMATE.start_create_data_~data~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_#t~mem8#1.base| |ULTIMATE.start_create_data_~data~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_create_data_#t~mem8#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:51,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {7424#(and (exists ((|ULTIMATE.start_create_data_~data~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))) (not (= |ULTIMATE.start_create_data_#t~mem8#1.base| |ULTIMATE.start_create_data_~data~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_create_data_#t~mem8#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[create_data_#t~mem8#1.base]); {7368#false} is VALID [2022-02-20 23:47:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:47:51,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:51,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (_ bv1 1))) is different from false [2022-02-20 23:47:51,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-02-20 23:47:51,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:51,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-02-20 23:47:51,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-02-20 23:47:51,340 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 13 treesize of output 9 [2022-02-20 23:47:55,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {7428#(= (select |#valid| |ULTIMATE.start_create_data_#t~mem8#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[create_data_#t~mem8#1.base]); {7368#false} is VALID [2022-02-20 23:47:55,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {7428#(= (select |#valid| |ULTIMATE.start_create_data_#t~mem8#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:55,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} is VALID [2022-02-20 23:47:55,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} create_data_#t~post7#1 := create_data_~counter~0#1;create_data_~counter~0#1 := ~bvadd32(1bv32, create_data_#t~post7#1);havoc create_data_#t~post7#1; {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} is VALID [2022-02-20 23:47:55,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} havoc create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset;havoc create_data_#t~nondet9#1; {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} is VALID [2022-02-20 23:47:55,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {7445#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(create_data_#t~nondet9#1, create_data_#t~mem8#1.base, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), 4bv32); srcloc: L558-1 {7432#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1))} is VALID [2022-02-20 23:47:55,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {7449#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {7445#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:55,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {7449#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {7449#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:55,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {7449#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} havoc create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset;create_data_~counter~0#1 := 0bv32;create_data_~counter~0#1 := 0bv32; {7449#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:55,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {7459#(or (and (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (_ bv0 1))) (forall ((v_arrayElimCell_24 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| v_arrayElimCell_24)))))} SUMMARY for call write~$Pointer$(create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L555 {7449#(forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_261) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:55,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {7463#(or (forall ((v_arrayElimCell_24 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |#valid| |ULTIMATE.start_create_data_~data~0#1.base| (_ bv1 1)) v_arrayElimCell_24) (_ bv1 1)))) (not (= (_ bv0 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))))} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {7459#(or (and (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (_ bv0 1))) (forall ((v_arrayElimCell_24 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| v_arrayElimCell_24)))))} is VALID [2022-02-20 23:47:55,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {7367#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {7463#(or (forall ((v_arrayElimCell_24 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |#valid| |ULTIMATE.start_create_data_~data~0#1.base| (_ bv1 1)) v_arrayElimCell_24) (_ bv1 1)))) (not (= (_ bv0 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))))} is VALID [2022-02-20 23:47:55,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {7367#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {7367#true} is VALID [2022-02-20 23:47:55,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {7367#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {7367#true} is VALID [2022-02-20 23:47:55,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {7367#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {7367#true} is VALID [2022-02-20 23:47:55,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {7367#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {7367#true} is VALID [2022-02-20 23:47:55,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {7367#true} is VALID [2022-02-20 23:47:55,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {7367#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {7367#true} is VALID [2022-02-20 23:47:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-20 23:47:55,442 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:55,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243487797] [2022-02-20 23:47:55,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243487797] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:55,442 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:55,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2022-02-20 23:47:55,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69877760] [2022-02-20 23:47:55,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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 18 [2022-02-20 23:47:55,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:55,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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:47:55,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:55,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:47:55,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:47:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=78, Unknown=3, NotChecked=38, Total=156 [2022-02-20 23:47:55,481 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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:47:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:57,326 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-02-20 23:47:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:57,326 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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 18 [2022-02-20 23:47:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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:47:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-02-20 23:47:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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:47:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2022-02-20 23:47:57,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 140 transitions. [2022-02-20 23:47:57,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:57,470 INFO L225 Difference]: With dead ends: 154 [2022-02-20 23:47:57,470 INFO L226 Difference]: Without dead ends: 154 [2022-02-20 23:47:57,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=45, Invalid=92, Unknown=3, NotChecked=42, Total=182 [2022-02-20 23:47:57,470 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 64 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:57,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 590 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 316 Invalid, 0 Unknown, 302 Unchecked, 0.6s Time] [2022-02-20 23:47:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-02-20 23:47:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2022-02-20 23:47:57,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:57,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 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:47:57,472 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 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:47:57,473 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 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:47:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:57,474 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-02-20 23:47:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-02-20 23:47:57,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:57,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:57,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 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 154 states. [2022-02-20 23:47:57,475 INFO L87 Difference]: Start difference. First operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 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 154 states. [2022-02-20 23:47:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:57,477 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-02-20 23:47:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2022-02-20 23:47:57,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:57,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:57,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:57,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 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:47:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-02-20 23:47:57,478 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2022-02-20 23:47:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:57,479 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-02-20 23:47:57,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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:47:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-02-20 23:47:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:47:57,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:57,479 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:57,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-20 23:47:57,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:57,687 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:47:57,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2022-02-20 23:47:57,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:57,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270405977] [2022-02-20 23:47:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:57,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:57,690 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:57,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:47:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:57,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:47:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:57,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:57,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:57,841 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:57,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:47:57,846 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 6 treesize of output 5 [2022-02-20 23:47:57,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:57,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:47:58,029 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:58,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-02-20 23:47:58,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-02-20 23:47:58,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-02-20 23:47:58,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:58,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {8055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {8055#true} is VALID [2022-02-20 23:47:58,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {8055#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {8055#true} is VALID [2022-02-20 23:47:58,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {8055#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {8055#true} is VALID [2022-02-20 23:47:58,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {8055#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {8055#true} is VALID [2022-02-20 23:47:58,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {8055#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {8055#true} is VALID [2022-02-20 23:47:58,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {8055#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {8055#true} is VALID [2022-02-20 23:47:58,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {8055#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {8078#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} is VALID [2022-02-20 23:47:58,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {8078#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {8082#(and (= |ULTIMATE.start_create_data_#t~malloc6#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|) (_ bv80 32)))} is VALID [2022-02-20 23:47:58,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {8082#(and (= |ULTIMATE.start_create_data_#t~malloc6#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|) (_ bv80 32)))} SUMMARY for call write~$Pointer$(create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L555 {8086#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:58,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {8086#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} havoc create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset;create_data_~counter~0#1 := 0bv32;create_data_~counter~0#1 := 0bv32; {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:58,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:58,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {8097#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} is VALID [2022-02-20 23:47:58,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {8097#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} SUMMARY for call write~intINTTYPE4(create_data_#t~nondet9#1, create_data_#t~mem8#1.base, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), 4bv32); srcloc: L558-1 {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:58,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} havoc create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset;havoc create_data_#t~nondet9#1; {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:58,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {8090#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} create_data_#t~post7#1 := create_data_~counter~0#1;create_data_~counter~0#1 := ~bvadd32(1bv32, create_data_#t~post7#1);havoc create_data_#t~post7#1; {8107#(and (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:58,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {8107#(and (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {8107#(and (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:58,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {8107#(and (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {8114#(and (= |ULTIMATE.start_create_data_#t~mem8#1.offset| (_ bv0 32)) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (= (_ bv80 32) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)))} is VALID [2022-02-20 23:47:58,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {8114#(and (= |ULTIMATE.start_create_data_#t~mem8#1.offset| (_ bv0 32)) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (= (_ bv80 32) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))), #length[create_data_#t~mem8#1.base]) && ~bvule32(~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), ~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))))) && ~bvule32(0bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)))); {8056#false} is VALID [2022-02-20 23:47:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:58,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:58,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse1 (_ bv4 32) .cse2) (bvadd .cse1 (_ bv8 32) .cse2))))) is different from false [2022-02-20 23:47:58,647 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2022-02-20 23:47:58,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-02-20 23:47:58,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:58,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-02-20 23:47:58,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-02-20 23:47:58,761 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 19 treesize of output 11 [2022-02-20 23:47:58,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:58,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-02-20 23:47:58,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:58,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-02-20 23:47:58,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:58,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-02-20 23:47:58,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:58,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-02-20 23:47:58,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {8118#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_data_#t~mem8#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)) (bvule (bvadd |ULTIMATE.start_create_data_#t~mem8#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_data_#t~mem8#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))), #length[create_data_#t~mem8#1.base]) && ~bvule32(~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), ~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))))) && ~bvule32(0bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)))); {8056#false} is VALID [2022-02-20 23:47:58,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {8122#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {8118#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_data_#t~mem8#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)) (bvule (bvadd |ULTIMATE.start_create_data_#t~mem8#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv4 32) |ULTIMATE.start_create_data_#t~mem8#1.offset| (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))))} is VALID [2022-02-20 23:47:58,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {8122#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {8122#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} is VALID [2022-02-20 23:47:59,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {8129#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} create_data_#t~post7#1 := create_data_~counter~0#1;create_data_~counter~0#1 := ~bvadd32(1bv32, create_data_#t~post7#1);havoc create_data_#t~post7#1; {8122#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} is VALID [2022-02-20 23:47:59,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {8129#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} havoc create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset;havoc create_data_#t~nondet9#1; {8129#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} is VALID [2022-02-20 23:47:59,478 WARN L290 TraceCheckUtils]: 12: Hoare triple {8136#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} SUMMARY for call write~intINTTYPE4(create_data_#t~nondet9#1, create_data_#t~mem8#1.base, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), 4bv32); srcloc: L558-1 {8129#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))))} is UNKNOWN [2022-02-20 23:47:59,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {8140#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {8136#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} is VALID [2022-02-20 23:47:59,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {8140#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {8140#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} is VALID [2022-02-20 23:47:59,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {8147#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} havoc create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset;create_data_~counter~0#1 := 0bv32;create_data_~counter~0#1 := 0bv32; {8140#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (bvmul (_ bv4 32) |ULTIMATE.start_create_data_~counter~0#1|)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} is VALID [2022-02-20 23:47:59,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {8151#(and (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_data_#t~malloc6#1.offset|) (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_data_#t~malloc6#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_create_data_#t~malloc6#1.offset|)))} SUMMARY for call write~$Pointer$(create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L555 {8147#(and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_304) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) v_ArrVal_303) |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))))} is VALID [2022-02-20 23:47:59,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {8078#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {8151#(and (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_create_data_#t~malloc6#1.offset|) (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_create_data_#t~malloc6#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_create_data_#t~malloc6#1.offset|)))} is VALID [2022-02-20 23:47:59,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {8055#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {8078#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} is VALID [2022-02-20 23:47:59,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {8055#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {8055#true} is VALID [2022-02-20 23:47:59,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {8055#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {8055#true} is VALID [2022-02-20 23:47:59,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {8055#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {8055#true} is VALID [2022-02-20 23:47:59,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {8055#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {8055#true} is VALID [2022-02-20 23:47:59,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {8055#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {8055#true} is VALID [2022-02-20 23:47:59,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {8055#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {8055#true} is VALID [2022-02-20 23:47:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-20 23:47:59,511 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:59,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270405977] [2022-02-20 23:47:59,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270405977] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:59,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:59,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2022-02-20 23:47:59,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192614465] [2022-02-20 23:47:59,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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 18 [2022-02-20 23:47:59,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:59,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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:48:00,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 25 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:00,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:48:00,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:00,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:48:00,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-02-20 23:48:00,330 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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:48:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:06,984 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-02-20 23:48:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:48:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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 18 [2022-02-20 23:48:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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:48:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2022-02-20 23:48:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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:48:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 146 transitions. [2022-02-20 23:48:06,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 146 transitions. [2022-02-20 23:48:07,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 145 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:07,218 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:48:07,218 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:48:07,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=297, Unknown=3, NotChecked=114, Total=506 [2022-02-20 23:48:07,219 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:07,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 679 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 478 Invalid, 0 Unknown, 299 Unchecked, 1.9s Time] [2022-02-20 23:48:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:48:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2022-02-20 23:48:07,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:07,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 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:48:07,221 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 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:48:07,221 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 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:48:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:07,222 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-02-20 23:48:07,222 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2022-02-20 23:48:07,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:07,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:07,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 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 160 states. [2022-02-20 23:48:07,223 INFO L87 Difference]: Start difference. First operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 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 160 states. [2022-02-20 23:48:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:07,225 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-02-20 23:48:07,225 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2022-02-20 23:48:07,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:07,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:07,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:07,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 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:48:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-02-20 23:48:07,227 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2022-02-20 23:48:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:07,227 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-02-20 23:48:07,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 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:48:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-02-20 23:48:07,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:07,227 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:07,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:07,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:07,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:07,435 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:48:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2022-02-20 23:48:07,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:07,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434959480] [2022-02-20 23:48:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:07,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:07,447 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:07,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:48:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:07,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:48:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:07,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:07,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:07,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:07,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:48:07,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {8780#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {8780#true} is VALID [2022-02-20 23:48:07,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {8780#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {8780#true} is VALID [2022-02-20 23:48:07,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {8780#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} assume 0bv32 != create_data_#t~nondet3#1;havoc create_data_#t~nondet3#1;create_data_#res#1.base, create_data_#res#1.offset := 0bv32, 0bv32; {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;assume { :end_inline_create_data } true; {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4bv32); srcloc: L578 {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:07,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {8791#(and (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call write~$Pointer$(append_~node~0#1.base, append_~node~0#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L579 {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :end_inline_append } true; {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !(0bv32 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L591-1 {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !!(main_#t~mem22#1.base != 0bv32 || main_#t~mem22#1.offset != 0bv32);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L588 {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_#t~mem17#1.base, ~bvadd32(4bv32, main_#t~mem17#1.offset), 4bv32); srcloc: L588-1 {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset; {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:48:07,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {8816#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L589 {8841#(= (select |#valid| |ULTIMATE.start_main_#t~mem19#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:07,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {8841#(= (select |#valid| |ULTIMATE.start_main_#t~mem19#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem19#1.base]); {8781#false} is VALID [2022-02-20 23:48:07,699 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:48:07,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:07,699 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:07,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434959480] [2022-02-20 23:48:07,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434959480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:07,699 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:07,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:07,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110969146] [2022-02-20 23:48:07,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:07,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:07,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:07,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:07,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:07,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:07,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:07,722 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:08,483 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-02-20 23:48:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:08,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2022-02-20 23:48:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2022-02-20 23:48:08,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 134 transitions. [2022-02-20 23:48:08,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:08,618 INFO L225 Difference]: With dead ends: 146 [2022-02-20 23:48:08,619 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 23:48:08,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:08,621 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:08,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 160 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:08,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 23:48:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2022-02-20 23:48:08,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:08,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 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:48:08,625 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 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:48:08,625 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 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:48:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:08,627 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-02-20 23:48:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2022-02-20 23:48:08,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:08,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:08,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 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 146 states. [2022-02-20 23:48:08,628 INFO L87 Difference]: Start difference. First operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 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 146 states. [2022-02-20 23:48:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:08,629 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-02-20 23:48:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2022-02-20 23:48:08,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:08,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:08,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:08,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 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:48:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-02-20 23:48:08,631 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2022-02-20 23:48:08,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:08,631 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-02-20 23:48:08,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-02-20 23:48:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:48:08,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:08,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:08,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:08,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:08,840 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:48:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:08,840 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2022-02-20 23:48:08,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:08,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696811587] [2022-02-20 23:48:08,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:08,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:08,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:08,850 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:08,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:48:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:08,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:48:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:08,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:08,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:09,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:09,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:09,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:48:09,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:48:09,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {9396#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {9396#true} is VALID [2022-02-20 23:48:09,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {9396#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {9396#true} is VALID [2022-02-20 23:48:09,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {9396#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume 0bv32 != create_data_#t~nondet3#1;havoc create_data_#t~nondet3#1;create_data_#res#1.base, create_data_#res#1.offset := 0bv32, 0bv32; {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;assume { :end_inline_create_data } true; {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4bv32); srcloc: L578 {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {9407#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_~node~0#1.base, append_~node~0#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L579 {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume { :end_inline_append } true; {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L591-1 {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !!(main_#t~mem22#1.base != 0bv32 || main_#t~mem22#1.offset != 0bv32);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L588 {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_#t~mem17#1.base, ~bvadd32(4bv32, main_#t~mem17#1.offset), 4bv32); srcloc: L588-1 {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset; {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:48:09,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {9432#(and (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L589 {9457#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem19#1.base|)) (= |ULTIMATE.start_main_#t~mem19#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:09,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {9457#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem19#1.base|)) (= |ULTIMATE.start_main_#t~mem19#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_#t~mem19#1.offset), #length[main_#t~mem19#1.base]) && ~bvule32(main_#t~mem19#1.offset, ~bvadd32(4bv32, main_#t~mem19#1.offset))) && ~bvule32(0bv32, main_#t~mem19#1.offset)); {9397#false} is VALID [2022-02-20 23:48:09,207 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:48:09,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:09,207 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:09,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696811587] [2022-02-20 23:48:09,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696811587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:09,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:09,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:09,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795297154] [2022-02-20 23:48:09,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:09,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:09,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:09,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:09,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:09,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:09,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:09,233 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:10,277 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-02-20 23:48:10,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:10,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-02-20 23:48:10,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2022-02-20 23:48:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2022-02-20 23:48:10,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 191 transitions. [2022-02-20 23:48:10,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:10,485 INFO L225 Difference]: With dead ends: 203 [2022-02-20 23:48:10,485 INFO L226 Difference]: Without dead ends: 203 [2022-02-20 23:48:10,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:10,486 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 164 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:10,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 187 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:10,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-20 23:48:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2022-02-20 23:48:10,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:10,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 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:48:10,488 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 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:48:10,488 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 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:48:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:10,490 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-02-20 23:48:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2022-02-20 23:48:10,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:10,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:10,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 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 203 states. [2022-02-20 23:48:10,491 INFO L87 Difference]: Start difference. First operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 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 203 states. [2022-02-20 23:48:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:10,493 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-02-20 23:48:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2022-02-20 23:48:10,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:10,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:10,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:10,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 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:48:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-02-20 23:48:10,495 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2022-02-20 23:48:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:10,495 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-02-20 23:48:10,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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:48:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-02-20 23:48:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:10,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:10,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:10,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:10,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:10,703 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:48:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2022-02-20 23:48:10,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:10,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92341331] [2022-02-20 23:48:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:10,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:10,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:10,705 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:10,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:48:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:10,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 23:48:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:10,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:10,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:10,837 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:10,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:48:10,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:48:10,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-02-20 23:48:11,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 23:48:11,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 23:48:11,228 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-02-20 23:48:11,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-02-20 23:48:11,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-02-20 23:48:11,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {10186#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {10186#true} is VALID [2022-02-20 23:48:11,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {10186#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {10194#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:11,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {10194#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:11,299 INFO L290 TraceCheckUtils]: 3: Hoare triple {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:11,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:11,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:11,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {10198#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} assume 0bv32 != create_data_#t~nondet3#1;havoc create_data_#t~nondet3#1;create_data_#res#1.base, create_data_#res#1.offset := 0bv32, 0bv32; {10211#(and (= |ULTIMATE.start_create_data_#res#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_create_data_#res#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} is VALID [2022-02-20 23:48:11,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {10211#(and (= |ULTIMATE.start_create_data_#res#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_create_data_#res#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|))} append_#t~ret15#1.base, append_#t~ret15#1.offset := create_data_#res#1.base, create_data_#res#1.offset;assume { :end_inline_create_data } true; {10215#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= (_ bv0 32) |ULTIMATE.start_append_#t~ret15#1.offset|) (= |ULTIMATE.start_append_#t~ret15#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:48:11,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {10215#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= (_ bv0 32) |ULTIMATE.start_append_#t~ret15#1.offset|) (= |ULTIMATE.start_append_#t~ret15#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~node~0#1.base, append_~node~0#1.offset, 4bv32); srcloc: L578 {10219#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:11,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {10219#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)))} havoc append_#t~ret15#1.base, append_#t~ret15#1.offset; {10219#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:11,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {10219#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_~pointerToList#1.base| |ULTIMATE.start_main_~#list~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~pointerToList#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) |ULTIMATE.start_append_~node~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_~node~0#1.base, append_~node~0#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L579 {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} assume { :end_inline_append } true; {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} assume !(0bv32 != main_#t~nondet16#1);havoc main_#t~nondet16#1; {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L591-1 {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} assume !!(main_#t~mem22#1.base != 0bv32 || main_#t~mem22#1.offset != 0bv32);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L588 {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} SUMMARY for call main_#t~mem18#1.base, main_#t~mem18#1.offset := read~$Pointer$(main_#t~mem17#1.base, ~bvadd32(4bv32, main_#t~mem17#1.offset), 4bv32); srcloc: L588-1 {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem18#1.base, main_#t~mem18#1.offset;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~mem18#1.base, main_#t~mem18#1.offset; {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} is VALID [2022-02-20 23:48:11,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {10226#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))))} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L589 {10251#(exists ((|ULTIMATE.start_main_~#list~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#list~0#1.offset| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_#t~mem19#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem19#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))} is VALID [2022-02-20 23:48:11,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {10251#(exists ((|ULTIMATE.start_main_~#list~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#list~0#1.offset| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_#t~mem19#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= |ULTIMATE.start_main_#t~mem19#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_#t~mem19#1.base, main_#t~mem19#1.offset, 4bv32); srcloc: L589-1 {10255#(and (= |ULTIMATE.start_main_#t~mem20#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem20#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:48:11,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {10255#(and (= |ULTIMATE.start_main_#t~mem20#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem20#1.base| (_ bv0 32)))} assume { :begin_inline_freeData } true;freeData_#in~data#1.base, freeData_#in~data#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc freeData_#t~mem11#1.base, freeData_#t~mem11#1.offset, freeData_#t~mem12#1.base, freeData_#t~mem12#1.offset, freeData_~data#1.base, freeData_~data#1.offset;freeData_~data#1.base, freeData_~data#1.offset := freeData_#in~data#1.base, freeData_#in~data#1.offset; {10259#(and (= |ULTIMATE.start_freeData_~data#1.offset| (_ bv0 32)) (= |ULTIMATE.start_freeData_~data#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:48:11,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {10259#(and (= |ULTIMATE.start_freeData_~data#1.offset| (_ bv0 32)) (= |ULTIMATE.start_freeData_~data#1.base| (_ bv0 32)))} assume !(freeData_~data#1.base == 0bv32 && freeData_~data#1.offset == 0bv32); {10187#false} is VALID [2022-02-20 23:48:11,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {10187#false} assume !(1bv1 == #valid[freeData_~data#1.base]); {10187#false} is VALID [2022-02-20 23:48:11,313 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:48:11,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:11,313 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:11,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92341331] [2022-02-20 23:48:11,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92341331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:11,313 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:11,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 23:48:11,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135270583] [2022-02-20 23:48:11,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:11,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:48:11,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:11,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:11,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:11,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:48:11,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:11,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:48:11,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:11,342 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,766 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2022-02-20 23:48:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:48:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:48:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 170 transitions. [2022-02-20 23:48:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 170 transitions. [2022-02-20 23:48:13,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 170 transitions. [2022-02-20 23:48:13,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:13,967 INFO L225 Difference]: With dead ends: 183 [2022-02-20 23:48:13,967 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 23:48:13,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:48:13,967 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 208 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:13,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 443 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 326 Invalid, 0 Unknown, 59 Unchecked, 0.8s Time] [2022-02-20 23:48:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 23:48:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 128. [2022-02-20 23:48:13,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:13,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 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:48:13,970 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 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:48:13,970 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 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:48:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,971 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2022-02-20 23:48:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2022-02-20 23:48:13,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:13,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:13,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 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 183 states. [2022-02-20 23:48:13,972 INFO L87 Difference]: Start difference. First operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 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 183 states. [2022-02-20 23:48:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:13,975 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2022-02-20 23:48:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2022-02-20 23:48:13,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:13,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:13,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:13,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 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:48:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-02-20 23:48:13,977 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2022-02-20 23:48:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:13,977 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-02-20 23:48:13,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-02-20 23:48:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:13,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:13,979 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:14,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:14,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:14,180 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2022-02-20 23:48:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2022-02-20 23:48:14,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:14,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649415405] [2022-02-20 23:48:14,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:48:14,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:14,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:14,182 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:48:14,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:48:14,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:48:14,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:48:14,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:48:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:14,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:14,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:14,383 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:14,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:48:14,388 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 6 treesize of output 5 [2022-02-20 23:48:14,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-02-20 23:48:14,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:48:14,571 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:14,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-02-20 23:48:14,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-02-20 23:48:14,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-02-20 23:48:14,786 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:14,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-02-20 23:48:14,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-02-20 23:48:14,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:48:14,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {10962#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32); {10962#true} is VALID [2022-02-20 23:48:14,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {10962#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~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {10962#true} is VALID [2022-02-20 23:48:14,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {10962#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset, append_#t~mem14#1.base, append_#t~mem14#1.offset, append_#t~ret15#1.base, append_#t~ret15#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc13#1.base, append_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc13#1.base, append_#t~malloc13#1.offset;havoc append_#t~malloc13#1.base, append_#t~malloc13#1.offset; {10962#true} is VALID [2022-02-20 23:48:14,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {10962#true} SUMMARY for call append_#t~mem14#1.base, append_#t~mem14#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L577 {10962#true} is VALID [2022-02-20 23:48:14,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {10962#true} SUMMARY for call write~$Pointer$(append_#t~mem14#1.base, append_#t~mem14#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L577-1 {10962#true} is VALID [2022-02-20 23:48:14,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {10962#true} havoc append_#t~mem14#1.base, append_#t~mem14#1.offset;assume { :begin_inline_create_data } true;havoc create_data_#res#1.base, create_data_#res#1.offset;havoc create_data_#t~nondet3#1, create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset, create_data_#t~nondet5#1, create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset, create_data_#t~nondet9#1, create_data_#t~post7#1, create_data_~counter~0#1, create_data_#t~nondet10#1, create_data_~data~0#1.base, create_data_~data~0#1.offset; {10962#true} is VALID [2022-02-20 23:48:14,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {10962#true} assume !(0bv32 != create_data_#t~nondet3#1);havoc create_data_#t~nondet3#1;call create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);create_data_~data~0#1.base, create_data_~data~0#1.offset := create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset;havoc create_data_#t~malloc4#1.base, create_data_#t~malloc4#1.offset; {10985#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} is VALID [2022-02-20 23:48:14,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {10985#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_create_data_~data~0#1.base|))} assume 0bv32 != create_data_#t~nondet5#1;havoc create_data_#t~nondet5#1;call create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset := #Ultimate.allocOnHeap(80bv32); {10989#(and (= |ULTIMATE.start_create_data_#t~malloc6#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|) (_ bv80 32)))} is VALID [2022-02-20 23:48:14,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {10989#(and (= |ULTIMATE.start_create_data_#t~malloc6#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| |ULTIMATE.start_create_data_#t~malloc6#1.base|)) (= (select |#length| |ULTIMATE.start_create_data_#t~malloc6#1.base|) (_ bv80 32)))} SUMMARY for call write~$Pointer$(create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset, create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L555 {10993#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {10993#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} havoc create_data_#t~malloc6#1.base, create_data_#t~malloc6#1.offset;create_data_~counter~0#1 := 0bv32;create_data_~counter~0#1 := 0bv32; {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {11004#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} is VALID [2022-02-20 23:48:14,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {11004#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} SUMMARY for call write~intINTTYPE4(create_data_#t~nondet9#1, create_data_#t~mem8#1.base, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), 4bv32); srcloc: L558-1 {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} havoc create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset;havoc create_data_#t~nondet9#1; {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {10997#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_create_data_~counter~0#1| (_ bv0 32)) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} create_data_#t~post7#1 := create_data_~counter~0#1;create_data_~counter~0#1 := ~bvadd32(1bv32, create_data_#t~post7#1);havoc create_data_#t~post7#1; {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {11021#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) |ULTIMATE.start_create_data_#t~mem8#1.offset|) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} is VALID [2022-02-20 23:48:14,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {11021#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) |ULTIMATE.start_create_data_#t~mem8#1.offset|) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_create_data_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))))} SUMMARY for call write~intINTTYPE4(create_data_#t~nondet9#1, create_data_#t~mem8#1.base, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), 4bv32); srcloc: L558-1 {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} havoc create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset;havoc create_data_#t~nondet9#1; {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {11014#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_create_data_~counter~0#1|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} create_data_#t~post7#1 := create_data_~counter~0#1;create_data_~counter~0#1 := ~bvadd32(1bv32, create_data_#t~post7#1);havoc create_data_#t~post7#1; {11031#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (_ bv2 32) |ULTIMATE.start_create_data_~counter~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {11031#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (_ bv2 32) |ULTIMATE.start_create_data_~counter~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(create_data_~counter~0#1, 20bv32); {11031#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (_ bv2 32) |ULTIMATE.start_create_data_~counter~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:48:14,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {11031#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_create_data_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (= (_ bv2 32) |ULTIMATE.start_create_data_~counter~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))) (_ bv0 32)))} SUMMARY for call create_data_#t~mem8#1.base, create_data_#t~mem8#1.offset := read~$Pointer$(create_data_~data~0#1.base, ~bvadd32(4bv32, create_data_~data~0#1.offset), 4bv32); srcloc: L558 {11038#(and (= |ULTIMATE.start_create_data_#t~mem8#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_create_data_~counter~0#1|) (= (_ bv80 32) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)))} is VALID [2022-02-20 23:48:14,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {11038#(and (= |ULTIMATE.start_create_data_#t~mem8#1.offset| (_ bv0 32)) (= (_ bv2 32) |ULTIMATE.start_create_data_~counter~0#1|) (= (_ bv80 32) (select |#length| |ULTIMATE.start_create_data_#t~mem8#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))), #length[create_data_#t~mem8#1.base]) && ~bvule32(~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)), ~bvadd32(4bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1))))) && ~bvule32(0bv32, ~bvadd32(create_data_#t~mem8#1.offset, ~bvmul32(4bv32, create_data_~counter~0#1)))); {10963#false} is VALID [2022-02-20 23:48:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:14,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:18,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:48:18,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 222 [2022-02-20 23:48:18,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:48:18,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 136 [2022-02-20 23:48:19,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 824 treesize of output 692 [2022-02-20 23:48:19,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2598 treesize of output 2388 [2022-02-20 23:48:19,857 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 2271 treesize of output 2111 [2022-02-20 23:48:19,870 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 2224 treesize of output 2128 [2022-02-20 23:48:19,897 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 2031 treesize of output 1871 [2022-02-20 23:48:19,917 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 1942 treesize of output 1614 [2022-02-20 23:48:19,937 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 1551 treesize of output 1511 [2022-02-20 23:48:19,947 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:19,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649415405] [2022-02-20 23:48:19,947 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:48:19,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:20,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:48:20,156 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:48:20,162 INFO L158 Benchmark]: Toolchain (without parser) took 46182.30ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 35.5MB in the beginning and 28.0MB in the end (delta: 7.5MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,162 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory is still 40.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:20,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.48ms. Allocated memory is still 58.7MB. Free memory was 35.3MB in the beginning and 28.7MB in the end (delta: 6.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.76ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 28.6MB in the beginning and 58.5MB in the end (delta: -29.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,163 INFO L158 Benchmark]: Boogie Preprocessor took 44.97ms. Allocated memory is still 75.5MB. Free memory was 58.5MB in the beginning and 56.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,163 INFO L158 Benchmark]: RCFGBuilder took 582.72ms. Allocated memory is still 75.5MB. Free memory was 55.8MB in the beginning and 52.1MB in the end (delta: 3.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,163 INFO L158 Benchmark]: TraceAbstraction took 45107.20ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.7MB in the beginning and 28.0MB in the end (delta: 23.7MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,164 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.19ms. Allocated memory is still 58.7MB. Free memory is still 40.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.48ms. Allocated memory is still 58.7MB. Free memory was 35.3MB in the beginning and 28.7MB in the end (delta: 6.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.76ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 28.6MB in the beginning and 58.5MB in the end (delta: -29.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.97ms. Allocated memory is still 75.5MB. Free memory was 58.5MB in the beginning and 56.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 582.72ms. Allocated memory is still 75.5MB. Free memory was 55.8MB in the beginning and 52.1MB in the end (delta: 3.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 45107.20ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 51.7MB in the beginning and 28.0MB in the end (delta: 23.7MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:48:20,202 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 Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range