./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_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/ldv-memsafety/memleaks_test11_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 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:47,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:47,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:47,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:47,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:47,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:47,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:47,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:47,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:47,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:47,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:47,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:47,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:47,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:47,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:47,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:47,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:47,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:47,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:47,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:47,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:47,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:47,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:47,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:47,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:47,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:47,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:47,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:47,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:47,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:47,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:47,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:47,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:47,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:47,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:47,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:47,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:47,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:47,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:47,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:47,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:47,209 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:49:47,225 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:47,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:47,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:47,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:47,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:47,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:47,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:47,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:47,231 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:47,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:47,232 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:47,232 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:47,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:47,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:47,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:47,233 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:47,233 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:47,233 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:47,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:47,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:47,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:47,234 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:47,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:47,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:47,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:47,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:47,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:47,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:47,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:47,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:47,235 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2022-02-20 23:49:47,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:47,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:47,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:47,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:47,476 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:47,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-02-20 23:49:47,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb644b16/f814a10e5c0944b4b7084bbf9d23256a/FLAGc601cc877 [2022-02-20 23:49:47,913 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:47,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-02-20 23:49:47,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb644b16/f814a10e5c0944b4b7084bbf9d23256a/FLAGc601cc877 [2022-02-20 23:49:47,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb644b16/f814a10e5c0944b4b7084bbf9d23256a [2022-02-20 23:49:47,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:47,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:47,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:47,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:47,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:47,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:47" (1/1) ... [2022-02-20 23:49:47,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f02b209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:47, skipping insertion in model container [2022-02-20 23:49:47,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:47" (1/1) ... [2022-02-20 23:49:47,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:47,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:48,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:48,252 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:49:48,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25d04b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:48, skipping insertion in model container [2022-02-20 23:49:48,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:48,253 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:49:48,255 INFO L158 Benchmark]: Toolchain (without parser) took 312.15ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 53.4MB in the beginning and 91.4MB in the end (delta: -38.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:49:48,255 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:48,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.19ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 53.4MB in the beginning and 91.4MB in the end (delta: -38.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:49:48,257 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.9MB in the beginning and 60.9MB in the end (delta: 25.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.19ms. Allocated memory was 90.2MB in the beginning and 121.6MB in the end (delta: 31.5MB). Free memory was 53.4MB in the beginning and 91.4MB in the end (delta: -38.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_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 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:49,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:49,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:49,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:49,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:49,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:49,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:49,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:49,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:49,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:49,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:49,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:49,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:49,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:49,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:49,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:49,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:49,794 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:49,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:49,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:49,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:49,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:49,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:49,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:49,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:49,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:49,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:49,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:49,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:49,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:49,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:49,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:49,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:49,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:49,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:49,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:49,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:49,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:49,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:49,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:49,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:49,813 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:49:49,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:49,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:49,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:49,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:49,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:49,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:49,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:49,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:49,830 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:49,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:49,830 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:49,830 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:49,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:49,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:49,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:49,831 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:49,831 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:49,831 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:49,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:49,831 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:49,832 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:49:49,832 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:49:49,832 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:49,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:49,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:49,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:49,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:49,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:49,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:49,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:49,833 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:49:49,833 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:49:49,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:49:49,834 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 -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2022-02-20 23:49:50,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:50,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:50,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:50,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:50,075 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:50,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-02-20 23:49:50,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503d5f6aa/784f2b107179419eb580c494487a8561/FLAGe49ceadd2 [2022-02-20 23:49:50,566 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:50,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-02-20 23:49:50,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503d5f6aa/784f2b107179419eb580c494487a8561/FLAGe49ceadd2 [2022-02-20 23:49:50,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503d5f6aa/784f2b107179419eb580c494487a8561 [2022-02-20 23:49:50,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:50,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:50,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:50,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:50,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:50,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:50,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7b81a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50, skipping insertion in model container [2022-02-20 23:49:50,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:50,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:50,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:51,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:51,311 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:49:51,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:51,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:51,354 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:49:51,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:51,440 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:49:51,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51 WrapperNode [2022-02-20 23:49:51,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:51,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:51,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:49:51,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:49:51,447 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:49:51" (1/1) ... [2022-02-20 23:49:51,471 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:49:51" (1/1) ... [2022-02-20 23:49:51,491 INFO L137 Inliner]: procedures = 169, calls = 88, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 96 [2022-02-20 23:49:51,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:51,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:49:51,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:49:51,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:49:51,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:49:51,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:49:51,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:49:51,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:49:51,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (1/1) ... [2022-02-20 23:49:51,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:51,556 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:49:51,558 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:49:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:49:51,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:49:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2022-02-20 23:49:51,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2022-02-20 23:49:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:49:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:49:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:49:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:49:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:49:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:49:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:49:51,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:49:51,696 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:49:51,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:49:52,003 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:49:52,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:49:52,016 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:49:52,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:52 BoogieIcfgContainer [2022-02-20 23:49:52,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:49:52,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:49:52,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:49:52,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:49:52,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:50" (1/3) ... [2022-02-20 23:49:52,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13366a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:52, skipping insertion in model container [2022-02-20 23:49:52,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:51" (2/3) ... [2022-02-20 23:49:52,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13366a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:52, skipping insertion in model container [2022-02-20 23:49:52,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:52" (3/3) ... [2022-02-20 23:49:52,026 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2022-02-20 23:49:52,031 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:49:52,031 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-02-20 23:49:52,075 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:49:52,081 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:49:52,081 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-02-20 23:49:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:49:52,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:52,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:52,104 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:49:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2113619829, now seen corresponding path program 1 times [2022-02-20 23:49:52,121 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:52,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488578334] [2022-02-20 23:49:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:52,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:52,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:52,125 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:49:52,126 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:49:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:52,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:52,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:52,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {93#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {93#true} is VALID [2022-02-20 23:49:52,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {93#true} is VALID [2022-02-20 23:49:52,326 INFO L272 TraceCheckUtils]: 2: Hoare triple {93#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {93#true} is VALID [2022-02-20 23:49:52,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {93#true} ~size := #in~size; {93#true} is VALID [2022-02-20 23:49:52,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {93#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {110#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:52,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {110#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:52,332 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {110#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {93#true} #123#return; {117#(not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:52,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {117#(not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {121#(not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:52,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {121#(not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} assume entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32; {94#false} is VALID [2022-02-20 23:49:52,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {94#false} assume { :end_inline_entry_point } true; {94#false} is VALID [2022-02-20 23:49:52,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {94#false} assume !(#valid == main_old_#valid#1); {94#false} is VALID [2022-02-20 23:49:52,334 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:49:52,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:52,336 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:52,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488578334] [2022-02-20 23:49:52,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488578334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:52,337 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:52,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:52,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131239320] [2022-02-20 23:49:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:52,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:52,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:52,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:52,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:52,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:52,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:52,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:52,391 INFO L87 Difference]: Start difference. First operand has 90 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,023 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2022-02-20 23:49:53,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:53,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2022-02-20 23:49:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2022-02-20 23:49:53,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 192 transitions. [2022-02-20 23:49:53,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:53,223 INFO L225 Difference]: With dead ends: 167 [2022-02-20 23:49:53,223 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 23:49:53,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:53,226 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 73 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:53,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 485 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 23:49:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2022-02-20 23:49:53,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:53,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:53,251 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:53,251 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,260 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-02-20 23:49:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2022-02-20 23:49:53,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:53,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:53,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 163 states. [2022-02-20 23:49:53,262 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 163 states. [2022-02-20 23:49:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,269 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-02-20 23:49:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2022-02-20 23:49:53,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:53,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:53,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:53,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-02-20 23:49:53,276 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 11 [2022-02-20 23:49:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:53,277 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-02-20 23:49:53,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-02-20 23:49:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:49:53,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:53,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:53,298 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:49:53,489 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:49:53,490 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:49:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:53,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1293843786, now seen corresponding path program 1 times [2022-02-20 23:49:53,491 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:53,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111680044] [2022-02-20 23:49:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:53,493 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:49:53,494 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:49:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:53,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:53,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:53,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {715#true} is VALID [2022-02-20 23:49:53,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,576 INFO L272 TraceCheckUtils]: 2: Hoare triple {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {727#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {727#(= |old(#valid)| |#valid|)} ~size := #in~size; {727#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {727#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {727#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#(= |old(#valid)| |#valid|)} assume true; {727#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,578 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {727#(= |old(#valid)| |#valid|)} {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #123#return; {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32; {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {716#false} is VALID [2022-02-20 23:49:53,580 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:49:53,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:53,580 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:53,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111680044] [2022-02-20 23:49:53,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111680044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:53,581 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:53,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:53,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237808604] [2022-02-20 23:49:53,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:53,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:53,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:53,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:53,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:53,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:53,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:53,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:53,593 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,184 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2022-02-20 23:49:54,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:54,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-02-20 23:49:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-02-20 23:49:54,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-02-20 23:49:54,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:54,345 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:49:54,345 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 23:49:54,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:54,346 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 70 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:54,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 321 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 23:49:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 88. [2022-02-20 23:49:54,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:54,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:54,352 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:54,352 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,357 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2022-02-20 23:49:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2022-02-20 23:49:54,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:54,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:54,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 161 states. [2022-02-20 23:49:54,359 INFO L87 Difference]: Start difference. First operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 161 states. [2022-02-20 23:49:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,365 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2022-02-20 23:49:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2022-02-20 23:49:54,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:54,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:54,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:54,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:49:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-02-20 23:49:54,369 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 11 [2022-02-20 23:49:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:54,370 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-02-20 23:49:54,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-02-20 23:49:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:49:54,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:54,371 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:54,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:54,577 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:49:54,577 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:49:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026591, now seen corresponding path program 1 times [2022-02-20 23:49:54,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:54,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020162981] [2022-02-20 23:49:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:54,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:54,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:54,580 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:49:54,582 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:49:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:54,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {1324#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1324#true} is VALID [2022-02-20 23:49:54,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {1324#true} is VALID [2022-02-20 23:49:54,701 INFO L272 TraceCheckUtils]: 2: Hoare triple {1324#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {1324#true} is VALID [2022-02-20 23:49:54,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {1324#true} ~size := #in~size; {1324#true} is VALID [2022-02-20 23:49:54,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {1324#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1324#true} is VALID [2022-02-20 23:49:54,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-02-20 23:49:54,702 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1324#true} {1324#true} #123#return; {1324#true} is VALID [2022-02-20 23:49:54,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {1324#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {1324#true} is VALID [2022-02-20 23:49:54,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {1324#true} is VALID [2022-02-20 23:49:54,703 INFO L272 TraceCheckUtils]: 9: Hoare triple {1324#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1324#true} is VALID [2022-02-20 23:49:54,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {1324#true} ~size := #in~size; {1324#true} is VALID [2022-02-20 23:49:54,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {1324#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1362#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,706 INFO L290 TraceCheckUtils]: 12: Hoare triple {1362#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1362#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,707 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1362#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {1324#true} #125#return; {1369#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1373#(not (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:54,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {1373#(not (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {1325#false} is VALID [2022-02-20 23:49:54,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#false} assume !(0bv32 == entry_point_~c11~0#1.offset); {1325#false} is VALID [2022-02-20 23:49:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:49:54,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:54,709 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:54,713 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020162981] [2022-02-20 23:49:54,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020162981] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:54,714 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:54,714 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:54,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785311783] [2022-02-20 23:49:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 23:49:54,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:54,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:54,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:54,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:54,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:54,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:54,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:54,728 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:55,138 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2022-02-20 23:49:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-02-20 23:49:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2022-02-20 23:49:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2022-02-20 23:49:55,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 181 transitions. [2022-02-20 23:49:55,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:55,286 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:49:55,286 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:49:55,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:55,288 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 68 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:55,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 470 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:49:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 92. [2022-02-20 23:49:55,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:55,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,292 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,293 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:55,297 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2022-02-20 23:49:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2022-02-20 23:49:55,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:55,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:55,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 160 states. [2022-02-20 23:49:55,298 INFO L87 Difference]: Start difference. First operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Second operand 160 states. [2022-02-20 23:49:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:55,302 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2022-02-20 23:49:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2022-02-20 23:49:55,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:55,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:55,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:55,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 23:49:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-02-20 23:49:55,306 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 17 [2022-02-20 23:49:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:55,306 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-02-20 23:49:55,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:49:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-20 23:49:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:49:55,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:55,307 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:55,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:55,513 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:49:55,513 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:49:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026607, now seen corresponding path program 1 times [2022-02-20 23:49:55,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:55,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038254340] [2022-02-20 23:49:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:55,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:55,516 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:49:55,518 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:49:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:55,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:49:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:55,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:55,609 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:49:55,717 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:49:55,717 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 18 treesize of output 25 [2022-02-20 23:49:55,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {1951#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1951#true} is VALID [2022-02-20 23:49:55,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1951#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {1951#true} is VALID [2022-02-20 23:49:55,738 INFO L272 TraceCheckUtils]: 2: Hoare triple {1951#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {1951#true} is VALID [2022-02-20 23:49:55,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {1951#true} ~size := #in~size; {1951#true} is VALID [2022-02-20 23:49:55,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {1951#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:55,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:55,741 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {1951#true} #123#return; {1975#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1975#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,742 INFO L272 TraceCheckUtils]: 9: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1986#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {1986#(= |old(#valid)| |#valid|)} ~size := #in~size; {1986#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {1986#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1993#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:49:55,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {1993#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {1993#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:49:55,753 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1993#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} #125#return; {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~c11~0#1.base]); {1952#false} is VALID [2022-02-20 23:49:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:55,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:57,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~c11~0#1.base]); {1952#false} is VALID [2022-02-20 23:49:57,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,999 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} #125#return; {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:57,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:49:58,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:49:58,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~size := #in~size; {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:49:58,002 INFO L272 TraceCheckUtils]: 9: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {2021#(forall ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:49:58,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:58,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {1975#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {1979#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:58,004 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {1951#true} #123#return; {1975#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:58,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:58,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {1951#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1968#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:58,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {1951#true} ~size := #in~size; {1951#true} is VALID [2022-02-20 23:49:58,005 INFO L272 TraceCheckUtils]: 2: Hoare triple {1951#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {1951#true} is VALID [2022-02-20 23:49:58,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {1951#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {1951#true} is VALID [2022-02-20 23:49:58,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {1951#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1951#true} is VALID [2022-02-20 23:49:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:58,006 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:58,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038254340] [2022-02-20 23:49:58,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038254340] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:58,007 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:49:58,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-02-20 23:49:58,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846201246] [2022-02-20 23:49:58,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:58,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-02-20 23:49:58,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:58,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:58,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:58,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:49:58,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:49:58,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:58,029 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:58,648 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-02-20 23:49:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:49:58,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-02-20 23:49:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-02-20 23:49:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-02-20 23:49:58,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 123 transitions. [2022-02-20 23:49:58,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:58,743 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:49:58,743 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:49:58,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:58,743 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:58,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 382 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2022-02-20 23:49:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:49:58,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-02-20 23:49:58,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:58,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 109 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 95 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:49:58,748 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 109 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 95 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:49:58,748 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 109 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 95 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:49:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:58,750 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-02-20 23:49:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2022-02-20 23:49:58,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:58,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:58,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 95 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Second operand 112 states. [2022-02-20 23:49:58,753 INFO L87 Difference]: Start difference. First operand has 109 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 95 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Second operand 112 states. [2022-02-20 23:49:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:58,755 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-02-20 23:49:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2022-02-20 23:49:58,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:58,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:58,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:58,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 95 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-20 23:49:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2022-02-20 23:49:58,758 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 17 [2022-02-20 23:49:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:58,759 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2022-02-20 23:49:58,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2022-02-20 23:49:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:49:58,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:58,759 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:58,768 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:49:58,965 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:49:58,966 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:49:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026606, now seen corresponding path program 1 times [2022-02-20 23:49:58,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:58,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094840931] [2022-02-20 23:49:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:58,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:58,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:58,968 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:49:58,968 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:49:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:59,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:49:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:59,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:59,078 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:49:59,084 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:50:01,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:01,274 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:50:01,282 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:01,283 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:50:01,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {2504#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2504#true} is VALID [2022-02-20 23:50:01,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {2504#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {2504#true} is VALID [2022-02-20 23:50:01,322 INFO L272 TraceCheckUtils]: 2: Hoare triple {2504#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {2504#true} is VALID [2022-02-20 23:50:01,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {2504#true} ~size := #in~size; {2518#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:01,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {2518#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,325 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2504#true} #123#return; {2529#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:01,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {2529#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,327 INFO L272 TraceCheckUtils]: 9: Hoare triple {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:01,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:01,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:01,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:01,331 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #125#return; {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~c11~0#1.offset), #length[entry_point_~c11~0#1.base]) && ~bvule32(entry_point_~c11~0#1.offset, ~bvadd32(4bv32, entry_point_~c11~0#1.offset))) && ~bvule32(0bv32, entry_point_~c11~0#1.offset)); {2505#false} is VALID [2022-02-20 23:50:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:01,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:03,597 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:03,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094840931] [2022-02-20 23:50:03,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094840931] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:03,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1473539517] [2022-02-20 23:50:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:03,597 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:03,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:03,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-02-20 23:50:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:03,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:03,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:03,705 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:50:03,711 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:50:05,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:05,865 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:50:05,873 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:05,873 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:50:05,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {2504#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {2504#true} is VALID [2022-02-20 23:50:05,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {2504#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {2504#true} is VALID [2022-02-20 23:50:05,897 INFO L272 TraceCheckUtils]: 2: Hoare triple {2504#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {2504#true} is VALID [2022-02-20 23:50:05,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {2504#true} ~size := #in~size; {2518#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:05,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {2518#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,900 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2522#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {2504#true} #123#return; {2529#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:05,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {2529#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,915 INFO L272 TraceCheckUtils]: 9: Hoare triple {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:05,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:05,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {2540#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:05,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:05,919 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2547#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_23 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {2533#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #125#return; {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:05,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {2554#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~c11~0#1.offset), #length[entry_point_~c11~0#1.base]) && ~bvule32(entry_point_~c11~0#1.offset, ~bvadd32(4bv32, entry_point_~c11~0#1.offset))) && ~bvule32(0bv32, entry_point_~c11~0#1.offset)); {2505#false} is VALID [2022-02-20 23:50:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:05,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:06,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1473539517] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:06,127 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:06,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-02-20 23:50:06,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687008885] [2022-02-20 23:50:06,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:06,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:06,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:06,146 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:50:06,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:06,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:06,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:06,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=85, Unknown=2, NotChecked=0, Total=110 [2022-02-20 23:50:06,147 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,260 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2022-02-20 23:50:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 222 transitions. [2022-02-20 23:50:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 222 transitions. [2022-02-20 23:50:10,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 222 transitions. [2022-02-20 23:50:10,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:10,453 INFO L225 Difference]: With dead ends: 203 [2022-02-20 23:50:10,453 INFO L226 Difference]: Without dead ends: 203 [2022-02-20 23:50:10,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=32, Invalid=121, Unknown=3, NotChecked=0, Total=156 [2022-02-20 23:50:10,454 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 162 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:10,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 613 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 413 Invalid, 0 Unknown, 82 Unchecked, 0.6s Time] [2022-02-20 23:50:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-20 23:50:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 145. [2022-02-20 23:50:10,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:10,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 145 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:10,460 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 145 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:10,461 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 145 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,465 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2022-02-20 23:50:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2022-02-20 23:50:10,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:10,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:10,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) Second operand 203 states. [2022-02-20 23:50:10,466 INFO L87 Difference]: Start difference. First operand has 145 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) Second operand 203 states. [2022-02-20 23:50:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:10,470 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2022-02-20 23:50:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 225 transitions. [2022-02-20 23:50:10,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:10,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:10,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:10,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-02-20 23:50:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2022-02-20 23:50:10,475 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 17 [2022-02-20 23:50:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:10,475 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2022-02-20 23:50:10,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2022-02-20 23:50:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:50:10,476 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:10,476 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:10,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-02-20 23:50:10,684 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:50:10,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:10,878 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:10,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:10,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2086429614, now seen corresponding path program 1 times [2022-02-20 23:50:10,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:10,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830452445] [2022-02-20 23:50:10,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:10,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:10,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:10,884 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:50:10,885 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:50:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:10,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:10,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:10,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {3395#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3395#true} is VALID [2022-02-20 23:50:10,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {3395#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {3395#true} is VALID [2022-02-20 23:50:10,993 INFO L272 TraceCheckUtils]: 2: Hoare triple {3395#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {3395#true} is VALID [2022-02-20 23:50:10,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {3395#true} ~size := #in~size; {3395#true} is VALID [2022-02-20 23:50:10,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {3395#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3412#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:10,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {3412#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {3412#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:10,996 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3412#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {3395#true} #123#return; {3419#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:10,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {3419#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {3423#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:11,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {3423#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {3396#false} is VALID [2022-02-20 23:50:11,008 INFO L272 TraceCheckUtils]: 9: Hoare triple {3396#false} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3396#false} is VALID [2022-02-20 23:50:11,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {3396#false} ~size := #in~size; {3396#false} is VALID [2022-02-20 23:50:11,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {3396#false} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3396#false} is VALID [2022-02-20 23:50:11,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {3396#false} assume true; {3396#false} is VALID [2022-02-20 23:50:11,011 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3396#false} {3396#false} #125#return; {3396#false} is VALID [2022-02-20 23:50:11,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {3396#false} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3396#false} is VALID [2022-02-20 23:50:11,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {3396#false} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {3396#false} is VALID [2022-02-20 23:50:11,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {3396#false} assume !(1bv1 == #valid[entry_point_~c11~0#1.base]); {3396#false} is VALID [2022-02-20 23:50:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:11,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:11,012 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:11,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830452445] [2022-02-20 23:50:11,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830452445] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:11,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:11,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:11,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393506609] [2022-02-20 23:50:11,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:11,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:11,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:11,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:11,024 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:50:11,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:11,025 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:11,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:11,026 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:11,385 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2022-02-20 23:50:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:11,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-02-20 23:50:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-02-20 23:50:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-02-20 23:50:11,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 101 transitions. [2022-02-20 23:50:11,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:11,469 INFO L225 Difference]: With dead ends: 136 [2022-02-20 23:50:11,469 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:50:11,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:11,470 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:11,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 378 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:50:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-02-20 23:50:11,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:11,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 134 states, 92 states have (on average 1.641304347826087) internal successors, (151), 119 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:11,475 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 134 states, 92 states have (on average 1.641304347826087) internal successors, (151), 119 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:11,475 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 134 states, 92 states have (on average 1.641304347826087) internal successors, (151), 119 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:11,478 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2022-02-20 23:50:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2022-02-20 23:50:11,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:11,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:11,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 92 states have (on average 1.641304347826087) internal successors, (151), 119 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 134 states. [2022-02-20 23:50:11,479 INFO L87 Difference]: Start difference. First operand has 134 states, 92 states have (on average 1.641304347826087) internal successors, (151), 119 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 134 states. [2022-02-20 23:50:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:11,482 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2022-02-20 23:50:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2022-02-20 23:50:11,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:11,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:11,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:11,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 92 states have (on average 1.641304347826087) internal successors, (151), 119 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2022-02-20 23:50:11,486 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 17 [2022-02-20 23:50:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:11,486 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2022-02-20 23:50:11,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2022-02-20 23:50:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:50:11,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:11,487 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:50:11,497 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:50:11,695 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:50:11,695 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:11,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1138254343, now seen corresponding path program 1 times [2022-02-20 23:50:11,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:11,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320536952] [2022-02-20 23:50:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:11,696 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:50:11,697 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:50:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:11,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:50:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:11,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:11,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {3988#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:11,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:11,988 INFO L272 TraceCheckUtils]: 2: Hoare triple {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:11,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:11,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4006#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {4006#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {4006#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,989 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4006#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {3993#(bvult (_ bv0 32) |#StackHeapBarrier|)} #123#return; {4013#(and (not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:50:11,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {4013#(and (not (= |ULTIMATE.start_entry_point_#t~ret43#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,992 INFO L272 TraceCheckUtils]: 9: Hoare triple {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:11,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} ~size := #in~size; {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:11,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:11,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} assume true; {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:11,998 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4024#(exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} #125#return; {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume 0bv32 == entry_point_~c11~0#1.offset; {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:11,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {4017#(and (bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 32))))} assume !~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {3989#false} is VALID [2022-02-20 23:50:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:11,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:12,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume !~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {3989#false} is VALID [2022-02-20 23:50:12,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume 0bv32 == entry_point_~c11~0#1.offset; {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,118 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3988#true} {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} #125#return; {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {3988#true} assume true; {3988#true} is VALID [2022-02-20 23:50:12,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {3988#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3988#true} is VALID [2022-02-20 23:50:12,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {3988#true} ~size := #in~size; {3988#true} is VALID [2022-02-20 23:50:12,118 INFO L272 TraceCheckUtils]: 9: Hoare triple {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3988#true} is VALID [2022-02-20 23:50:12,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#(bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|)} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {4049#(bvult |ULTIMATE.start_entry_point_~c11~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,123 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4087#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {3988#true} #123#return; {4080#(bvult |ULTIMATE.start_entry_point_#t~ret43#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {4087#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {4087#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {3988#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4087#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:12,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {3988#true} ~size := #in~size; {3988#true} is VALID [2022-02-20 23:50:12,124 INFO L272 TraceCheckUtils]: 2: Hoare triple {3988#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {3988#true} is VALID [2022-02-20 23:50:12,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {3988#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {3988#true} is VALID [2022-02-20 23:50:12,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {3988#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {3988#true} is VALID [2022-02-20 23:50:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:12,124 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:12,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320536952] [2022-02-20 23:50:12,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320536952] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:12,125 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:12,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-02-20 23:50:12,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665440520] [2022-02-20 23:50:12,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-02-20 23:50:12,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:12,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:12,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:12,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:12,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:12,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:12,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:12,158 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:13,202 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-02-20 23:50:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-02-20 23:50:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-02-20 23:50:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-02-20 23:50:13,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 108 transitions. [2022-02-20 23:50:13,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:13,311 INFO L225 Difference]: With dead ends: 136 [2022-02-20 23:50:13,311 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 23:50:13,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:13,312 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:13,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 398 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2022-02-20 23:50:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 23:50:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2022-02-20 23:50:13,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:13,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 133 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 118 states have internal predecessors, (149), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:13,316 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 133 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 118 states have internal predecessors, (149), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:13,316 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 133 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 118 states have internal predecessors, (149), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:13,319 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-02-20 23:50:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-02-20 23:50:13,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:13,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:13,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 118 states have internal predecessors, (149), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 136 states. [2022-02-20 23:50:13,320 INFO L87 Difference]: Start difference. First operand has 133 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 118 states have internal predecessors, (149), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Second operand 136 states. [2022-02-20 23:50:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:13,323 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-02-20 23:50:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2022-02-20 23:50:13,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:13,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:13,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:13,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 118 states have internal predecessors, (149), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-02-20 23:50:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2022-02-20 23:50:13,326 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 18 [2022-02-20 23:50:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:13,327 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2022-02-20 23:50:13,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2022-02-20 23:50:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:50:13,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:13,328 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:13,351 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:50:13,533 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:50:13,534 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:13,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash 968466533, now seen corresponding path program 1 times [2022-02-20 23:50:13,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:13,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569772443] [2022-02-20 23:50:13,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:13,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:13,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:13,536 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:50:13,536 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:50:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:50:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:13,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {4645#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {4645#true} is VALID [2022-02-20 23:50:13,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {4645#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {4653#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:13,781 INFO L272 TraceCheckUtils]: 2: Hoare triple {4653#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,781 INFO L290 TraceCheckUtils]: 3: Hoare triple {4657#(= |old(#valid)| |#valid|)} ~size := #in~size; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {4657#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} assume true; {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,784 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} {4653#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #123#return; {4671#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {4671#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,786 INFO L272 TraceCheckUtils]: 9: Hoare triple {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {4657#(= |old(#valid)| |#valid|)} ~size := #in~size; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {4657#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {4657#(= |old(#valid)| |#valid|)} assume true; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:13,789 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4657#(= |old(#valid)| |#valid|)} {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} #125#return; {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume 0bv32 == entry_point_~c11~0#1.offset; {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume ~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:13,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {4675#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)))} assume 0bv32 == entry_point_~c11~0#1.base || 1bv1 == #valid[entry_point_~c11~0#1.base];call ULTIMATE.dealloc(entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset); {4709#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:13,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {4709#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} assume { :end_inline_entry_point } true; {4709#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:13,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {4709#(exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1)) |#valid|) (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1))))} assume !(#valid == main_old_#valid#1); {4646#false} is VALID [2022-02-20 23:50:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:13,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:17,952 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:17,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569772443] [2022-02-20 23:50:17,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569772443] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:17,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [387031270] [2022-02-20 23:50:17,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:17,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:17,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:17,954 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:17,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-02-20 23:50:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:18,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:50:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:18,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:18,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {4645#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {4764#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:50:18,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {4764#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {4768#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,259 INFO L272 TraceCheckUtils]: 2: Hoare triple {4768#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:18,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {4657#(= |old(#valid)| |#valid|)} ~size := #in~size; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:18,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {4657#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:18,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} assume true; {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} is VALID [2022-02-20 23:50:18,261 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4664#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_44) |#valid|)))} {4768#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} #123#return; {4784#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {4784#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base|))) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret43#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,263 INFO L272 TraceCheckUtils]: 9: Hoare triple {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:18,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {4657#(= |old(#valid)| |#valid|)} ~size := #in~size; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:18,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {4657#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:18,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {4657#(= |old(#valid)| |#valid|)} assume true; {4657#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:18,265 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4657#(= |old(#valid)| |#valid|)} {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} #125#return; {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32; {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == entry_point_~c11~0#1.offset; {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume ~bvult32(entry_point_~c11~0#1.base, #StackHeapBarrier); {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {4788#(and (= (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)) (_ bv0 1)) (exists ((v_ArrVal_44 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| v_ArrVal_44) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == entry_point_~c11~0#1.base || 1bv1 == #valid[entry_point_~c11~0#1.base];call ULTIMATE.dealloc(entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset); {4768#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {4768#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume { :end_inline_entry_point } true; {4768#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:18,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {4768#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume !(#valid == main_old_#valid#1); {4646#false} is VALID [2022-02-20 23:50:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:18,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:22,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [387031270] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:22,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:22,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-02-20 23:50:22,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526654724] [2022-02-20 23:50:22,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:22,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-02-20 23:50:22,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:22,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:22,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:22,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:50:22,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:50:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=166, Unknown=2, NotChecked=0, Total=210 [2022-02-20 23:50:22,448 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,349 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-02-20 23:50:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:23,349 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-02-20 23:50:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-02-20 23:50:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2022-02-20 23:50:23,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 110 transitions. [2022-02-20 23:50:23,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:23,446 INFO L225 Difference]: With dead ends: 142 [2022-02-20 23:50:23,446 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 23:50:23,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=50, Invalid=220, Unknown=2, NotChecked=0, Total=272 [2022-02-20 23:50:23,447 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 14 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:23,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 551 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 254 Unchecked, 0.1s Time] [2022-02-20 23:50:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 23:50:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2022-02-20 23:50:23,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:23,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 130 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 115 states have internal predecessors, (145), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:23,451 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 130 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 115 states have internal predecessors, (145), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:23,451 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 130 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 115 states have internal predecessors, (145), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:23,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,454 INFO L93 Difference]: Finished difference Result 135 states and 171 transitions. [2022-02-20 23:50:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2022-02-20 23:50:23,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:23,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:23,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 115 states have internal predecessors, (145), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Second operand 135 states. [2022-02-20 23:50:23,456 INFO L87 Difference]: Start difference. First operand has 130 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 115 states have internal predecessors, (145), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Second operand 135 states. [2022-02-20 23:50:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:23,458 INFO L93 Difference]: Finished difference Result 135 states and 171 transitions. [2022-02-20 23:50:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2022-02-20 23:50:23,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:23,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:23,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:23,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 115 states have internal predecessors, (145), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-02-20 23:50:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2022-02-20 23:50:23,461 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 21 [2022-02-20 23:50:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:23,462 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2022-02-20 23:50:23,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2022-02-20 23:50:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:23,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:23,462 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:23,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:23,674 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:50:23,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:23,864 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -406257806, now seen corresponding path program 1 times [2022-02-20 23:50:23,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:23,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279023281] [2022-02-20 23:50:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:23,867 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:50:23,868 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:50:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:23,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:23,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:23,973 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:50:24,056 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:24,056 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:50:24,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {5418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {5418#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L272 TraceCheckUtils]: 2: Hoare triple {5418#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {5418#true} ~size := #in~size; {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {5418#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {5418#true} assume true; {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5418#true} {5418#true} #123#return; {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {5418#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {5418#true} is VALID [2022-02-20 23:50:24,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {5418#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {5418#true} is VALID [2022-02-20 23:50:24,072 INFO L272 TraceCheckUtils]: 9: Hoare triple {5418#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5418#true} is VALID [2022-02-20 23:50:24,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {5418#true} ~size := #in~size; {5418#true} is VALID [2022-02-20 23:50:24,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {5418#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:24,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:24,074 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {5418#true} #125#return; {5463#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {5463#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,076 INFO L272 TraceCheckUtils]: 17: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5477#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:24,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {5477#(= |old(#valid)| |#valid|)} ~size := #in~size; {5477#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:24,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {5477#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5484#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:24,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {5484#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {5484#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:24,079 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5484#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} #127#return; {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~cfg~1#1.base]); {5419#false} is VALID [2022-02-20 23:50:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:24,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:24,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~cfg~1#1.base]); {5419#false} is VALID [2022-02-20 23:50:24,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,259 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} #127#return; {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume true; {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:24,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:24,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} ~size := #in~size; {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:24,262 INFO L272 TraceCheckUtils]: 17: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5512#(forall ((|v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (= (select |#valid| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)) (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~cfg~1#1.base_BEFORE_CALL_2|) (_ bv1 1)))))} is VALID [2022-02-20 23:50:24,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {5463#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5467#(= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,264 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {5418#true} #125#return; {5463#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:24,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:24,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {5418#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5456#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:24,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {5418#true} ~size := #in~size; {5418#true} is VALID [2022-02-20 23:50:24,265 INFO L272 TraceCheckUtils]: 9: Hoare triple {5418#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5418#true} is VALID [2022-02-20 23:50:24,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {5418#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {5418#true} is VALID [2022-02-20 23:50:24,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {5418#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {5418#true} is VALID [2022-02-20 23:50:24,265 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5418#true} {5418#true} #123#return; {5418#true} is VALID [2022-02-20 23:50:24,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {5418#true} assume true; {5418#true} is VALID [2022-02-20 23:50:24,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {5418#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5418#true} is VALID [2022-02-20 23:50:24,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {5418#true} ~size := #in~size; {5418#true} is VALID [2022-02-20 23:50:24,266 INFO L272 TraceCheckUtils]: 2: Hoare triple {5418#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {5418#true} is VALID [2022-02-20 23:50:24,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {5418#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {5418#true} is VALID [2022-02-20 23:50:24,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {5418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {5418#true} is VALID [2022-02-20 23:50:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:24,267 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:24,267 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279023281] [2022-02-20 23:50:24,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279023281] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:24,267 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:24,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-02-20 23:50:24,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889612170] [2022-02-20 23:50:24,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:24,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:50:24,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:24,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:24,293 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:50:24,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:50:24,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:50:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:24,294 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:25,183 INFO L93 Difference]: Finished difference Result 199 states and 255 transitions. [2022-02-20 23:50:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:25,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:50:25,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-02-20 23:50:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2022-02-20 23:50:25,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 153 transitions. [2022-02-20 23:50:25,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:25,316 INFO L225 Difference]: With dead ends: 199 [2022-02-20 23:50:25,316 INFO L226 Difference]: Without dead ends: 199 [2022-02-20 23:50:25,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:25,317 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:25,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 432 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 235 Invalid, 0 Unknown, 78 Unchecked, 0.3s Time] [2022-02-20 23:50:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-02-20 23:50:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2022-02-20 23:50:25,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:25,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 130 states have internal predecessors, (169), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:25,321 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 130 states have internal predecessors, (169), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:25,321 INFO L87 Difference]: Start difference. First operand 199 states. Second operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 130 states have internal predecessors, (169), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:25,329 INFO L93 Difference]: Finished difference Result 199 states and 255 transitions. [2022-02-20 23:50:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 255 transitions. [2022-02-20 23:50:25,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:25,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:25,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 130 states have internal predecessors, (169), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) Second operand 199 states. [2022-02-20 23:50:25,337 INFO L87 Difference]: Start difference. First operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 130 states have internal predecessors, (169), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) Second operand 199 states. [2022-02-20 23:50:25,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:25,342 INFO L93 Difference]: Finished difference Result 199 states and 255 transitions. [2022-02-20 23:50:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 255 transitions. [2022-02-20 23:50:25,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:25,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:25,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:25,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 130 states have internal predecessors, (169), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-02-20 23:50:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 194 transitions. [2022-02-20 23:50:25,348 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 194 transitions. Word has length 25 [2022-02-20 23:50:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:25,348 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 194 transitions. [2022-02-20 23:50:25,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 194 transitions. [2022-02-20 23:50:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:25,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:25,349 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:25,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-02-20 23:50:25,556 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:50:25,556 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:25,556 INFO L85 PathProgramCache]: Analyzing trace with hash -406257805, now seen corresponding path program 1 times [2022-02-20 23:50:25,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:25,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036267664] [2022-02-20 23:50:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:25,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:25,558 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:50:25,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:50:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:25,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:50:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:25,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:25,655 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:50:29,822 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:50:29,823 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 14 [2022-02-20 23:50:29,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {6319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {6319#true} is VALID [2022-02-20 23:50:29,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {6319#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {6319#true} is VALID [2022-02-20 23:50:29,848 INFO L272 TraceCheckUtils]: 2: Hoare triple {6319#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {6319#true} is VALID [2022-02-20 23:50:29,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {6319#true} ~size := #in~size; {6319#true} is VALID [2022-02-20 23:50:29,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {6319#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6319#true} is VALID [2022-02-20 23:50:29,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {6319#true} assume true; {6319#true} is VALID [2022-02-20 23:50:29,849 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6319#true} {6319#true} #123#return; {6319#true} is VALID [2022-02-20 23:50:29,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {6319#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {6319#true} is VALID [2022-02-20 23:50:29,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {6319#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {6319#true} is VALID [2022-02-20 23:50:29,849 INFO L272 TraceCheckUtils]: 9: Hoare triple {6319#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {6319#true} is VALID [2022-02-20 23:50:29,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {6319#true} ~size := #in~size; {6354#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:29,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {6354#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6358#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {6358#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6358#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,852 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6358#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {6319#true} #125#return; {6365#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {6365#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,854 INFO L272 TraceCheckUtils]: 17: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {6379#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:29,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {6379#(= |#length| |old(#length)|)} ~size := #in~size; {6383#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:29,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {6383#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6387#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:29,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {6387#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} assume true; {6387#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:29,857 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6387#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} #127#return; {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:29,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~cfg~1#1.offset), #length[entry_point_~cfg~1#1.base]) && ~bvule32(entry_point_~cfg~1#1.offset, ~bvadd32(4bv32, entry_point_~cfg~1#1.offset))) && ~bvule32(0bv32, entry_point_~cfg~1#1.offset)); {6320#false} is VALID [2022-02-20 23:50:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:29,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:30,103 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:30,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036267664] [2022-02-20 23:50:30,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036267664] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:30,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1268902192] [2022-02-20 23:50:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:30,103 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:30,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:30,105 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:30,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-02-20 23:50:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:30,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:30,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:30,252 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:50:30,257 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:50:36,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:36,533 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:50:36,542 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:36,543 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:50:36,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {6319#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {6319#true} is VALID [2022-02-20 23:50:36,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {6319#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L272 TraceCheckUtils]: 2: Hoare triple {6319#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {6319#true} ~size := #in~size; {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {6319#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {6319#true} assume true; {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6319#true} {6319#true} #123#return; {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {6319#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {6319#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {6319#true} is VALID [2022-02-20 23:50:36,567 INFO L272 TraceCheckUtils]: 9: Hoare triple {6319#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {6319#true} is VALID [2022-02-20 23:50:36,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {6319#true} ~size := #in~size; {6354#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:36,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {6354#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6450#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {6450#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6450#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,570 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6450#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {6319#true} #125#return; {6457#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {6457#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {6461#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {6461#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {6461#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {6461#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {6461#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,572 INFO L272 TraceCheckUtils]: 17: Hoare triple {6461#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {6471#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:36,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {6471#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {6471#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:36,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {6471#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {6478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:36,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {6478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {6478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:36,576 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6478#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {6461#(and (= (select |#valid| |ULTIMATE.start_entry_point_~cfg~1#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} #127#return; {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:36,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {6369#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~cfg~1#1.base|)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~cfg~1#1.offset), #length[entry_point_~cfg~1#1.base]) && ~bvule32(entry_point_~cfg~1#1.offset, ~bvadd32(4bv32, entry_point_~cfg~1#1.offset))) && ~bvule32(0bv32, entry_point_~cfg~1#1.offset)); {6320#false} is VALID [2022-02-20 23:50:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:36,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:36,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1268902192] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:36,826 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:36,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-02-20 23:50:36,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894900641] [2022-02-20 23:50:36,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-02-20 23:50:36,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:36,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:36,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:36,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:50:36,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:50:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=225, Unknown=4, NotChecked=0, Total=272 [2022-02-20 23:50:36,858 INFO L87 Difference]: Start difference. First operand 148 states and 194 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,409 INFO L93 Difference]: Finished difference Result 273 states and 354 transitions. [2022-02-20 23:50:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:41,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-02-20 23:50:41,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2022-02-20 23:50:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2022-02-20 23:50:41,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 203 transitions. [2022-02-20 23:50:41,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:41,590 INFO L225 Difference]: With dead ends: 273 [2022-02-20 23:50:41,591 INFO L226 Difference]: Without dead ends: 273 [2022-02-20 23:50:41,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=56, Invalid=281, Unknown=5, NotChecked=0, Total=342 [2022-02-20 23:50:41,591 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 102 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:41,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 815 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 399 Invalid, 0 Unknown, 137 Unchecked, 0.6s Time] [2022-02-20 23:50:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-20 23:50:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 206. [2022-02-20 23:50:41,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:41,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 206 states, 157 states have (on average 1.624203821656051) internal successors, (255), 182 states have internal predecessors, (255), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:41,596 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 206 states, 157 states have (on average 1.624203821656051) internal successors, (255), 182 states have internal predecessors, (255), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:41,596 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 206 states, 157 states have (on average 1.624203821656051) internal successors, (255), 182 states have internal predecessors, (255), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,601 INFO L93 Difference]: Finished difference Result 273 states and 354 transitions. [2022-02-20 23:50:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 354 transitions. [2022-02-20 23:50:41,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 157 states have (on average 1.624203821656051) internal successors, (255), 182 states have internal predecessors, (255), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) Second operand 273 states. [2022-02-20 23:50:41,602 INFO L87 Difference]: Start difference. First operand has 206 states, 157 states have (on average 1.624203821656051) internal successors, (255), 182 states have internal predecessors, (255), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) Second operand 273 states. [2022-02-20 23:50:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:41,607 INFO L93 Difference]: Finished difference Result 273 states and 354 transitions. [2022-02-20 23:50:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 354 transitions. [2022-02-20 23:50:41,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:41,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:41,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:41,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.624203821656051) internal successors, (255), 182 states have internal predecessors, (255), 16 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-02-20 23:50:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 294 transitions. [2022-02-20 23:50:41,611 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 294 transitions. Word has length 25 [2022-02-20 23:50:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:41,611 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 294 transitions. [2022-02-20 23:50:41,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 294 transitions. [2022-02-20 23:50:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:41,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:41,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:41,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:41,822 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:50:42,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:42,015 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:42,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash -911816431, now seen corresponding path program 1 times [2022-02-20 23:50:42,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:42,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781467098] [2022-02-20 23:50:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:42,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:42,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:42,016 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:50:42,017 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:50:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:42,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:42,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:42,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {7536#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {7536#true} is VALID [2022-02-20 23:50:42,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {7536#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {7536#true} is VALID [2022-02-20 23:50:42,158 INFO L272 TraceCheckUtils]: 2: Hoare triple {7536#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {7536#true} is VALID [2022-02-20 23:50:42,159 INFO L290 TraceCheckUtils]: 3: Hoare triple {7536#true} ~size := #in~size; {7536#true} is VALID [2022-02-20 23:50:42,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {7536#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {7536#true} is VALID [2022-02-20 23:50:42,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {7536#true} assume true; {7536#true} is VALID [2022-02-20 23:50:42,160 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7536#true} {7536#true} #123#return; {7536#true} is VALID [2022-02-20 23:50:42,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {7536#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {7536#true} is VALID [2022-02-20 23:50:42,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {7536#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {7536#true} is VALID [2022-02-20 23:50:42,160 INFO L272 TraceCheckUtils]: 9: Hoare triple {7536#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {7536#true} is VALID [2022-02-20 23:50:42,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {7536#true} ~size := #in~size; {7536#true} is VALID [2022-02-20 23:50:42,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {7536#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {7574#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {7574#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {7574#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,162 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7574#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {7536#true} #125#return; {7581#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {7581#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {7585#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {7585#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {7537#false} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L272 TraceCheckUtils]: 17: Hoare triple {7537#false} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {7537#false} ~size := #in~size; {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {7537#false} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {7537#false} assume true; {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7537#false} {7537#false} #127#return; {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L290 TraceCheckUtils]: 22: Hoare triple {7537#false} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L290 TraceCheckUtils]: 23: Hoare triple {7537#false} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {7537#false} is VALID [2022-02-20 23:50:42,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {7537#false} assume !(1bv1 == #valid[entry_point_~cfg~1#1.base]); {7537#false} is VALID [2022-02-20 23:50:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:42,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:42,164 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:42,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781467098] [2022-02-20 23:50:42,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781467098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:42,164 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:42,164 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:42,164 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065977923] [2022-02-20 23:50:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:42,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:50:42,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:42,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:42,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:42,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:42,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:42,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:42,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:42,186 INFO L87 Difference]: Start difference. First operand 206 states and 294 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,530 INFO L93 Difference]: Finished difference Result 161 states and 212 transitions. [2022-02-20 23:50:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:50:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-02-20 23:50:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-02-20 23:50:42,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 96 transitions. [2022-02-20 23:50:42,603 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:50:42,604 INFO L225 Difference]: With dead ends: 161 [2022-02-20 23:50:42,605 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:50:42,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:42,605 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:42,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:50:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-02-20 23:50:42,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:42,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 116 states have (on average 1.5775862068965518) internal successors, (183), 139 states have internal predecessors, (183), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,609 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 116 states have (on average 1.5775862068965518) internal successors, (183), 139 states have internal predecessors, (183), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,609 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 116 states have (on average 1.5775862068965518) internal successors, (183), 139 states have internal predecessors, (183), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,611 INFO L93 Difference]: Finished difference Result 157 states and 208 transitions. [2022-02-20 23:50:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2022-02-20 23:50:42,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:42,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:42,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 116 states have (on average 1.5775862068965518) internal successors, (183), 139 states have internal predecessors, (183), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 157 states. [2022-02-20 23:50:42,613 INFO L87 Difference]: Start difference. First operand has 157 states, 116 states have (on average 1.5775862068965518) internal successors, (183), 139 states have internal predecessors, (183), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 157 states. [2022-02-20 23:50:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:42,615 INFO L93 Difference]: Finished difference Result 157 states and 208 transitions. [2022-02-20 23:50:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2022-02-20 23:50:42,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:42,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:42,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:42,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 116 states have (on average 1.5775862068965518) internal successors, (183), 139 states have internal predecessors, (183), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2022-02-20 23:50:42,618 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 25 [2022-02-20 23:50:42,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:42,618 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2022-02-20 23:50:42,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2022-02-20 23:50:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:50:42,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:42,619 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:42,629 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:50:42,829 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:50:42,830 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash 290909999, now seen corresponding path program 1 times [2022-02-20 23:50:42,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:42,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278146346] [2022-02-20 23:50:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:42,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:42,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:42,832 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:50:42,833 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:50:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:42,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:50:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:42,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:42,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {8247#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {8247#true} is VALID [2022-02-20 23:50:42,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {8247#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {8247#true} is VALID [2022-02-20 23:50:42,942 INFO L272 TraceCheckUtils]: 2: Hoare triple {8247#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {8247#true} is VALID [2022-02-20 23:50:42,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {8247#true} ~size := #in~size; {8247#true} is VALID [2022-02-20 23:50:42,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {8247#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {8247#true} is VALID [2022-02-20 23:50:42,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {8247#true} assume true; {8247#true} is VALID [2022-02-20 23:50:42,942 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8247#true} {8247#true} #123#return; {8247#true} is VALID [2022-02-20 23:50:42,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {8247#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {8247#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L272 TraceCheckUtils]: 9: Hoare triple {8247#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {8247#true} ~size := #in~size; {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {8247#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {8247#true} assume true; {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8247#true} {8247#true} #125#return; {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {8247#true} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {8247#true} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {8247#true} is VALID [2022-02-20 23:50:42,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {8247#true} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {8247#true} is VALID [2022-02-20 23:50:42,944 INFO L272 TraceCheckUtils]: 17: Hoare triple {8247#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {8247#true} is VALID [2022-02-20 23:50:42,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {8247#true} ~size := #in~size; {8247#true} is VALID [2022-02-20 23:50:42,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {8247#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {8309#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {8309#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {8309#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,945 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8309#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {8247#true} #127#return; {8316#(not (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {8316#(not (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {8320#(not (= |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:42,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {8320#(not (= |ULTIMATE.start_entry_point_~fe~1#1.base| (_ bv0 32)))} assume entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32; {8248#false} is VALID [2022-02-20 23:50:42,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {8248#false} assume 0bv32 == entry_point_~cfg~1#1.offset; {8248#false} is VALID [2022-02-20 23:50:42,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {8248#false} assume !~bvult32(entry_point_~cfg~1#1.base, #StackHeapBarrier); {8248#false} is VALID [2022-02-20 23:50:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:50:42,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:42,946 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:42,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278146346] [2022-02-20 23:50:42,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278146346] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:42,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:42,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:42,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886509042] [2022-02-20 23:50:42,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 23:50:42,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:42,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:42,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:42,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:42,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:42,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:42,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:42,964 INFO L87 Difference]: Start difference. First operand 157 states and 208 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,325 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2022-02-20 23:50:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 23:50:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2022-02-20 23:50:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2022-02-20 23:50:43,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 161 transitions. [2022-02-20 23:50:43,444 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:50:43,446 INFO L225 Difference]: With dead ends: 206 [2022-02-20 23:50:43,446 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 23:50:43,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:43,447 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 59 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:43,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 384 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 23:50:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 154. [2022-02-20 23:50:43,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:43,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 154 states, 113 states have (on average 1.575221238938053) internal successors, (178), 136 states have internal predecessors, (178), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:43,450 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 154 states, 113 states have (on average 1.575221238938053) internal successors, (178), 136 states have internal predecessors, (178), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:43,450 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 154 states, 113 states have (on average 1.575221238938053) internal successors, (178), 136 states have internal predecessors, (178), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,453 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2022-02-20 23:50:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 255 transitions. [2022-02-20 23:50:43,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 113 states have (on average 1.575221238938053) internal successors, (178), 136 states have internal predecessors, (178), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 206 states. [2022-02-20 23:50:43,454 INFO L87 Difference]: Start difference. First operand has 154 states, 113 states have (on average 1.575221238938053) internal successors, (178), 136 states have internal predecessors, (178), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 206 states. [2022-02-20 23:50:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:43,457 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2022-02-20 23:50:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 255 transitions. [2022-02-20 23:50:43,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:43,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:43,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:43,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 113 states have (on average 1.575221238938053) internal successors, (178), 136 states have internal predecessors, (178), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 203 transitions. [2022-02-20 23:50:43,459 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 203 transitions. Word has length 26 [2022-02-20 23:50:43,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:43,460 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 203 transitions. [2022-02-20 23:50:43,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 23:50:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 203 transitions. [2022-02-20 23:50:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:50:43,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:43,460 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:43,467 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:50:43,666 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:50:43,667 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1178413680, now seen corresponding path program 1 times [2022-02-20 23:50:43,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:43,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258643844] [2022-02-20 23:50:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:43,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:43,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:43,669 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:50:43,670 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:50:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:43,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:44,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {9101#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,326 INFO L272 TraceCheckUtils]: 2: Hoare triple {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume true; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,333 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} {9106#(bvult (_ bv0 32) |#StackHeapBarrier|)} #123#return; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,339 INFO L272 TraceCheckUtils]: 9: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} ~size := #in~size; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9141#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {9141#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume true; {9141#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,349 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9141#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} #125#return; {9148#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))) (bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:50:44,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {9148#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))) (bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,365 INFO L272 TraceCheckUtils]: 17: Hoare triple {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} ~size := #in~size; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} assume true; {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} is VALID [2022-02-20 23:50:44,373 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9119#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32)))))} {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} #127#return; {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32; {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume 0bv32 == entry_point_~cfg~1#1.offset; {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} is VALID [2022-02-20 23:50:44,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {9152#(and (bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))))} assume !~bvult32(entry_point_~cfg~1#1.base, #StackHeapBarrier); {9102#false} is VALID [2022-02-20 23:50:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:44,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:44,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume !~bvult32(entry_point_~cfg~1#1.base, #StackHeapBarrier); {9102#false} is VALID [2022-02-20 23:50:44,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume 0bv32 == entry_point_~cfg~1#1.offset; {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32; {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,548 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9101#true} {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} #127#return; {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {9101#true} assume true; {9101#true} is VALID [2022-02-20 23:50:44,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {9101#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {9101#true} is VALID [2022-02-20 23:50:44,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {9101#true} ~size := #in~size; {9101#true} is VALID [2022-02-20 23:50:44,548 INFO L272 TraceCheckUtils]: 17: Hoare triple {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {9101#true} is VALID [2022-02-20 23:50:44,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {9220#(bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|)} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {9186#(bvult |ULTIMATE.start_entry_point_~cfg~1#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,549 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9227#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {9101#true} #125#return; {9220#(bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {9227#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {9227#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {9101#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9227#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:44,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {9101#true} ~size := #in~size; {9101#true} is VALID [2022-02-20 23:50:44,550 INFO L272 TraceCheckUtils]: 9: Hoare triple {9101#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {9101#true} is VALID [2022-02-20 23:50:44,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {9101#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {9101#true} is VALID [2022-02-20 23:50:44,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {9101#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {9101#true} is VALID [2022-02-20 23:50:44,550 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9101#true} {9101#true} #123#return; {9101#true} is VALID [2022-02-20 23:50:44,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {9101#true} assume true; {9101#true} is VALID [2022-02-20 23:50:44,550 INFO L290 TraceCheckUtils]: 4: Hoare triple {9101#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9101#true} is VALID [2022-02-20 23:50:44,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {9101#true} ~size := #in~size; {9101#true} is VALID [2022-02-20 23:50:44,551 INFO L272 TraceCheckUtils]: 2: Hoare triple {9101#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {9101#true} is VALID [2022-02-20 23:50:44,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {9101#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {9101#true} is VALID [2022-02-20 23:50:44,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {9101#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {9101#true} is VALID [2022-02-20 23:50:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:50:44,551 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:44,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258643844] [2022-02-20 23:50:44,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258643844] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:44,552 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:44,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-02-20 23:50:44,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619496529] [2022-02-20 23:50:44,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:44,553 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-02-20 23:50:44,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:44,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:44,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:44,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:44,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:44,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:44,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:44,628 INFO L87 Difference]: Start difference. First operand 154 states and 203 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,004 INFO L93 Difference]: Finished difference Result 160 states and 207 transitions. [2022-02-20 23:50:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:45,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-02-20 23:50:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-02-20 23:50:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-02-20 23:50:45,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-02-20 23:50:45,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:45,163 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:50:45,163 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:50:45,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:45,164 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:45,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 307 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 34 Unchecked, 0.0s Time] [2022-02-20 23:50:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:50:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-02-20 23:50:45,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:45,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 160 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 141 states have internal predecessors, (182), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,167 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 160 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 141 states have internal predecessors, (182), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,167 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 160 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 141 states have internal predecessors, (182), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,169 INFO L93 Difference]: Finished difference Result 160 states and 207 transitions. [2022-02-20 23:50:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2022-02-20 23:50:45,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 141 states have internal predecessors, (182), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 160 states. [2022-02-20 23:50:45,170 INFO L87 Difference]: Start difference. First operand has 160 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 141 states have internal predecessors, (182), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 160 states. [2022-02-20 23:50:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,172 INFO L93 Difference]: Finished difference Result 160 states and 207 transitions. [2022-02-20 23:50:45,172 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2022-02-20 23:50:45,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:45,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 141 states have internal predecessors, (182), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2022-02-20 23:50:45,175 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 26 [2022-02-20 23:50:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:45,175 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2022-02-20 23:50:45,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2022-02-20 23:50:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:45,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:45,176 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:45,187 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:50:45,387 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:50:45,387 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 428272563, now seen corresponding path program 1 times [2022-02-20 23:50:45,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:45,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935203700] [2022-02-20 23:50:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:45,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:45,389 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:50:45,390 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:50:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:45,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:50:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:45,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:45,531 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:45,531 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:50:45,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {9904#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {9904#true} is VALID [2022-02-20 23:50:45,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {9904#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {9904#true} is VALID [2022-02-20 23:50:45,557 INFO L272 TraceCheckUtils]: 2: Hoare triple {9904#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {9904#true} is VALID [2022-02-20 23:50:45,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {9904#true} ~size := #in~size; {9904#true} is VALID [2022-02-20 23:50:45,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {9904#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9904#true} is VALID [2022-02-20 23:50:45,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {9904#true} assume true; {9904#true} is VALID [2022-02-20 23:50:45,557 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9904#true} {9904#true} #123#return; {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {9904#true} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {9904#true} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L272 TraceCheckUtils]: 9: Hoare triple {9904#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {9904#true} ~size := #in~size; {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {9904#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {9904#true} assume true; {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {9904#true} {9904#true} #125#return; {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {9904#true} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {9904#true} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {9904#true} is VALID [2022-02-20 23:50:45,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {9904#true} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:45,559 INFO L272 TraceCheckUtils]: 17: Hoare triple {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {9961#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:45,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {9961#(= |old(#valid)| |#valid|)} ~size := #in~size; {9961#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:45,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {9961#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {9968#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:45,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {9968#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {9968#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:45,561 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9968#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} #127#return; {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:45,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:45,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:45,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L812 {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:45,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {9957#(= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1))} assume { :begin_inline_alloc_2_11 } true;alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_2_11_#res#1;havoc alloc_2_11_#t~mem39#1.base, alloc_2_11_#t~mem39#1.offset, alloc_2_11_#t~mem40#1.base, alloc_2_11_#t~mem40#1.offset, alloc_2_11_#t~ret41#1.base, alloc_2_11_#t~ret41#1.offset, alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset, alloc_2_11_~cfg~0#1.base, alloc_2_11_~cfg~0#1.offset, alloc_2_11_~fe~0#1.base, alloc_2_11_~fe~0#1.offset, alloc_2_11_~priv~0#1.base, alloc_2_11_~priv~0#1.offset;alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset := alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset; {9987#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|))} is VALID [2022-02-20 23:50:45,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {9987#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|))} assume !(1bv1 == #valid[alloc_2_11_~client#1.base]); {9905#false} is VALID [2022-02-20 23:50:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:45,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:45,563 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:45,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935203700] [2022-02-20 23:50:45,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935203700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:45,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:45,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:45,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028830795] [2022-02-20 23:50:45,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:45,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:45,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:45,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:45,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:45,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:45,583 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,384 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-02-20 23:50:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:50:46,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2022-02-20 23:50:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2022-02-20 23:50:46,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 135 transitions. [2022-02-20 23:50:46,505 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:50:46,507 INFO L225 Difference]: With dead ends: 198 [2022-02-20 23:50:46,507 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:50:46,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:50:46,507 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 90 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:46,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 331 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-02-20 23:50:46,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:50:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 159. [2022-02-20 23:50:46,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:46,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 159 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 140 states have internal predecessors, (180), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:46,510 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 159 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 140 states have internal predecessors, (180), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:46,511 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 159 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 140 states have internal predecessors, (180), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,514 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-02-20 23:50:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-02-20 23:50:46,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 140 states have internal predecessors, (180), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 198 states. [2022-02-20 23:50:46,515 INFO L87 Difference]: Start difference. First operand has 159 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 140 states have internal predecessors, (180), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) Second operand 198 states. [2022-02-20 23:50:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:46,518 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2022-02-20 23:50:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2022-02-20 23:50:46,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:46,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:46,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:46,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 140 states have internal predecessors, (180), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-02-20 23:50:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 205 transitions. [2022-02-20 23:50:46,521 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 205 transitions. Word has length 27 [2022-02-20 23:50:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:46,521 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 205 transitions. [2022-02-20 23:50:46,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 205 transitions. [2022-02-20 23:50:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:46,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:46,522 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:46,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-02-20 23:50:46,729 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:50:46,729 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 428272564, now seen corresponding path program 1 times [2022-02-20 23:50:46,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:46,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852292646] [2022-02-20 23:50:46,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:46,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:46,731 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:50:46,733 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:50:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:50:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:46,828 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:50:46,832 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:50:48,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:48,989 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:50:48,996 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:48,997 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:50:49,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:49,121 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:50:49,129 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:49,129 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:50:49,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {10745#true} is VALID [2022-02-20 23:50:49,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {10745#true} is VALID [2022-02-20 23:50:49,179 INFO L272 TraceCheckUtils]: 2: Hoare triple {10745#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {10745#true} is VALID [2022-02-20 23:50:49,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {10745#true} ~size := #in~size; {10759#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:49,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {10759#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,182 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {10745#true} #123#return; {10770#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:49,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {10770#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,183 INFO L272 TraceCheckUtils]: 9: Hoare triple {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,186 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #125#return; {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,188 INFO L272 TraceCheckUtils]: 17: Hoare triple {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,191 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #127#return; {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L812 {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume { :begin_inline_alloc_2_11 } true;alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_2_11_#res#1;havoc alloc_2_11_#t~mem39#1.base, alloc_2_11_#t~mem39#1.offset, alloc_2_11_#t~mem40#1.base, alloc_2_11_#t~mem40#1.offset, alloc_2_11_#t~ret41#1.base, alloc_2_11_#t~ret41#1.offset, alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset, alloc_2_11_~cfg~0#1.base, alloc_2_11_~cfg~0#1.offset, alloc_2_11_~fe~0#1.base, alloc_2_11_~fe~0#1.offset, alloc_2_11_~priv~0#1.base, alloc_2_11_~priv~0#1.offset;alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset := alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset; {10832#(and (= (select |#length| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv20 32)) (= |ULTIMATE.start_alloc_2_11_~client#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {10832#(and (= (select |#length| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv20 32)) (= |ULTIMATE.start_alloc_2_11_~client#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_2_11_~client#1.offset), #length[alloc_2_11_~client#1.base]) && ~bvule32(alloc_2_11_~client#1.offset, ~bvadd32(4bv32, alloc_2_11_~client#1.offset))) && ~bvule32(0bv32, alloc_2_11_~client#1.offset)); {10746#false} is VALID [2022-02-20 23:50:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:49,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:51,513 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:51,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852292646] [2022-02-20 23:50:51,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852292646] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:51,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1919658485] [2022-02-20 23:50:51,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:51,514 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:51,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:51,515 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:51,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-02-20 23:50:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:51,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:50:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:51,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:51,673 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:50:51,679 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:50:51,821 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:51,821 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:50:51,828 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:50:51,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:51,973 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:50:51,980 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:51,980 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:50:52,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {10745#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {10745#true} is VALID [2022-02-20 23:50:52,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {10745#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {10745#true} is VALID [2022-02-20 23:50:52,011 INFO L272 TraceCheckUtils]: 2: Hoare triple {10745#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {10745#true} is VALID [2022-02-20 23:50:52,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {10745#true} ~size := #in~size; {10759#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:52,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {10759#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,013 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {10763#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {10745#true} #123#return; {10770#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:52,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {10770#(and (= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|) (= (select |#length| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv20 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret43#1.base|) (_ bv1 1)))} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,014 INFO L272 TraceCheckUtils]: 9: Hoare triple {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:52,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:52,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10890#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:52,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {10890#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} assume true; {10890#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:52,017 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {10890#(and (exists ((v_ArrVal_202 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_202))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #125#return; {10897#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {10897#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (not (= |ULTIMATE.start_entry_point_~c11~0#1.base| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,019 INFO L272 TraceCheckUtils]: 17: Hoare triple {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:52,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:52,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {10781#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:52,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:52,029 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10788#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_177 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_177) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {10774#(and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} #127#return; {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L812 {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {10795#(and (= (select |#length| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv20 32)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)))} assume { :begin_inline_alloc_2_11 } true;alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_2_11_#res#1;havoc alloc_2_11_#t~mem39#1.base, alloc_2_11_#t~mem39#1.offset, alloc_2_11_#t~mem40#1.base, alloc_2_11_#t~mem40#1.offset, alloc_2_11_#t~ret41#1.base, alloc_2_11_#t~ret41#1.offset, alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset, alloc_2_11_~cfg~0#1.base, alloc_2_11_~cfg~0#1.offset, alloc_2_11_~fe~0#1.base, alloc_2_11_~fe~0#1.offset, alloc_2_11_~priv~0#1.base, alloc_2_11_~priv~0#1.offset;alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset := alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset; {10832#(and (= (select |#length| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv20 32)) (= |ULTIMATE.start_alloc_2_11_~client#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:52,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {10832#(and (= (select |#length| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv20 32)) (= |ULTIMATE.start_alloc_2_11_~client#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_2_11_~client#1.offset), #length[alloc_2_11_~client#1.base]) && ~bvule32(alloc_2_11_~client#1.offset, ~bvadd32(4bv32, alloc_2_11_~client#1.offset))) && ~bvule32(0bv32, alloc_2_11_~client#1.offset)); {10746#false} is VALID [2022-02-20 23:50:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:52,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:54,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1919658485] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:54,318 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:54,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2022-02-20 23:50:54,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606000659] [2022-02-20 23:50:54,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-02-20 23:50:54,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:54,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:54,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:54,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:50:54,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:54,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:50:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=173, Unknown=2, NotChecked=0, Total=210 [2022-02-20 23:50:54,348 INFO L87 Difference]: Start difference. First operand 159 states and 205 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:56,665 INFO L93 Difference]: Finished difference Result 217 states and 241 transitions. [2022-02-20 23:50:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:50:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-02-20 23:50:56,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2022-02-20 23:50:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2022-02-20 23:50:56,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 205 transitions. [2022-02-20 23:50:56,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:56,853 INFO L225 Difference]: With dead ends: 217 [2022-02-20 23:50:56,853 INFO L226 Difference]: Without dead ends: 217 [2022-02-20 23:50:56,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=60, Invalid=280, Unknown=2, NotChecked=0, Total=342 [2022-02-20 23:50:56,854 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 218 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:56,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 541 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 464 Invalid, 0 Unknown, 68 Unchecked, 0.7s Time] [2022-02-20 23:50:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-20 23:50:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 128. [2022-02-20 23:50:56,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:56,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 128 states, 90 states have (on average 1.488888888888889) internal successors, (134), 112 states have internal predecessors, (134), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:50:56,858 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 128 states, 90 states have (on average 1.488888888888889) internal successors, (134), 112 states have internal predecessors, (134), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:50:56,858 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 128 states, 90 states have (on average 1.488888888888889) internal successors, (134), 112 states have internal predecessors, (134), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:50:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:56,861 INFO L93 Difference]: Finished difference Result 217 states and 241 transitions. [2022-02-20 23:50:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 241 transitions. [2022-02-20 23:50:56,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:56,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:56,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 90 states have (on average 1.488888888888889) internal successors, (134), 112 states have internal predecessors, (134), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 217 states. [2022-02-20 23:50:56,862 INFO L87 Difference]: Start difference. First operand has 128 states, 90 states have (on average 1.488888888888889) internal successors, (134), 112 states have internal predecessors, (134), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 217 states. [2022-02-20 23:50:56,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:56,867 INFO L93 Difference]: Finished difference Result 217 states and 241 transitions. [2022-02-20 23:50:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 241 transitions. [2022-02-20 23:50:56,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:56,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:56,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:56,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.488888888888889) internal successors, (134), 112 states have internal predecessors, (134), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:50:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2022-02-20 23:50:56,870 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 27 [2022-02-20 23:50:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:56,871 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2022-02-20 23:50:56,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2022-02-20 23:50:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:50:56,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:56,872 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:56,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-02-20 23:50:57,083 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:50:57,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:57,281 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 26 more)] === [2022-02-20 23:50:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:57,281 INFO L85 PathProgramCache]: Analyzing trace with hash -746927052, now seen corresponding path program 1 times [2022-02-20 23:50:57,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:57,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066194363] [2022-02-20 23:50:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:57,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:57,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:57,282 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:57,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:50:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:57,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:50:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:57,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:57,462 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:50:57,491 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:50:57,634 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-02-20 23:50:57,634 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 29 treesize of output 27 [2022-02-20 23:50:57,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:50:57,741 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 47 treesize of output 38 [2022-02-20 23:50:57,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {11741#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {11741#true} is VALID [2022-02-20 23:50:57,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {11741#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset, entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~ret46#1, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset; {11741#true} is VALID [2022-02-20 23:50:57,860 INFO L272 TraceCheckUtils]: 2: Hoare triple {11741#true} call entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset := ldv_malloc(20bv32); {11741#true} is VALID [2022-02-20 23:50:57,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {11741#true} ~size := #in~size; {11741#true} is VALID [2022-02-20 23:50:57,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {11741#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:57,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:57,861 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} {11741#true} #123#return; {11765#(= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|)} is VALID [2022-02-20 23:50:57,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {11765#(= (_ bv0 32) |ULTIMATE.start_entry_point_#t~ret43#1.offset|)} entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset := entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset;havoc entry_point_#t~ret43#1.base, entry_point_#t~ret43#1.offset; {11769#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:57,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {11769#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} assume !(entry_point_~c11~0#1.base == 0bv32 && entry_point_~c11~0#1.offset == 0bv32); {11769#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:57,862 INFO L272 TraceCheckUtils]: 9: Hoare triple {11769#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {11741#true} is VALID [2022-02-20 23:50:57,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {11741#true} ~size := #in~size; {11741#true} is VALID [2022-02-20 23:50:57,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {11741#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:57,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:57,864 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11758#(= |ldv_malloc_#res.offset| (_ bv0 32))} {11769#(= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32))} #125#return; {11788#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:57,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {11788#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {11792#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:57,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {11792#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~cfg~1#1.base == 0bv32 && entry_point_~cfg~1#1.offset == 0bv32); {11792#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:57,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {11792#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset, 4bv32); srcloc: L808 {11799#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:57,867 INFO L272 TraceCheckUtils]: 17: Hoare triple {11799#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {11741#true} is VALID [2022-02-20 23:50:57,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {11741#true} ~size := #in~size; {11741#true} is VALID [2022-02-20 23:50:57,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {11741#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {11809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:57,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {11809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {11809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:57,869 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11809#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {11799#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} #127#return; {11816#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:50:57,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {11816#(and (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1)))} entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset := entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset;havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {11820#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:57,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {11820#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} assume !(entry_point_~fe~1#1.base == 0bv32 && entry_point_~fe~1#1.offset == 0bv32); {11820#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:57,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {11820#(and (= (select |#valid| |ULTIMATE.start_entry_point_~fe~1#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_~fe~1#1.base, entry_point_~fe~1#1.offset, entry_point_~cfg~1#1.base, entry_point_~cfg~1#1.offset, 4bv32); srcloc: L812 {11827#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 32))) (_ bv1 1))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (_ bv0 32))) (_ bv1 1)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|))))))} is VALID [2022-02-20 23:50:57,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {11827#(and (= |ULTIMATE.start_entry_point_~c11~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) (_ bv0 32))) (_ bv1 1))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|)) (_ bv0 32))) (_ bv1 1)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~c11~0#1.base|) |ULTIMATE.start_entry_point_~c11~0#1.offset|))))))} assume { :begin_inline_alloc_2_11 } true;alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset := entry_point_~c11~0#1.base, entry_point_~c11~0#1.offset;havoc alloc_2_11_#res#1;havoc alloc_2_11_#t~mem39#1.base, alloc_2_11_#t~mem39#1.offset, alloc_2_11_#t~mem40#1.base, alloc_2_11_#t~mem40#1.offset, alloc_2_11_#t~ret41#1.base, alloc_2_11_#t~ret41#1.offset, alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset, alloc_2_11_~cfg~0#1.base, alloc_2_11_~cfg~0#1.offset, alloc_2_11_~fe~0#1.base, alloc_2_11_~fe~0#1.offset, alloc_2_11_~priv~0#1.base, alloc_2_11_~priv~0#1.offset;alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset := alloc_2_11_#in~client#1.base, alloc_2_11_#in~client#1.offset; {11831#(and (= |ULTIMATE.start_alloc_2_11_~client#1.offset| (_ bv0 32)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv0 32))) (_ bv0 32))) (_ bv1 1)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv0 32))))) (and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv0 32)))))))} is VALID [2022-02-20 23:50:57,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {11831#(and (= |ULTIMATE.start_alloc_2_11_~client#1.offset| (_ bv0 32)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv0 32))) (_ bv0 32))) (_ bv1 1)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv0 32))))) (and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_2_11_~client#1.base|) (_ bv0 32)))))))} SUMMARY for call alloc_2_11_#t~mem39#1.base, alloc_2_11_#t~mem39#1.offset := read~$Pointer$(alloc_2_11_~client#1.base, alloc_2_11_~client#1.offset, 4bv32); srcloc: L784 {11835#(exists ((|ULTIMATE.start_alloc_2_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (and (= (select |#valid| |ULTIMATE.start_alloc_2_11_#t~mem39#1.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| v_arrayElimCell_28))) (and (= (select |#valid| |ULTIMATE.start_alloc_2_11_#t~mem39#1.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|)))) (or (not (= |ULTIMATE.start_alloc_2_11_#t~mem39#1.base| |ULTIMATE.start_alloc_2_11_~client#1.base|)) (= |ULTIMATE.start_alloc_2_11_#t~mem39#1.base| v_arrayElimCell_28))))} is VALID [2022-02-20 23:50:57,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {11835#(exists ((|ULTIMATE.start_alloc_2_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (and (= (select |#valid| |ULTIMATE.start_alloc_2_11_#t~mem39#1.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| v_arrayElimCell_28))) (and (= (select |#valid| |ULTIMATE.start_alloc_2_11_#t~mem39#1.base|) (_ bv1 1)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|)))) (or (not (= |ULTIMATE.start_alloc_2_11_#t~mem39#1.base| |ULTIMATE.start_alloc_2_11_~client#1.base|)) (= |ULTIMATE.start_alloc_2_11_#t~mem39#1.base| v_arrayElimCell_28))))} alloc_2_11_~cfg~0#1.base, alloc_2_11_~cfg~0#1.offset := alloc_2_11_#t~mem39#1.base, alloc_2_11_#t~mem39#1.offset;havoc alloc_2_11_#t~mem39#1.base, alloc_2_11_#t~mem39#1.offset; {11839#(exists ((|ULTIMATE.start_alloc_2_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (and (= (_ bv1 1) (select |#valid| v_arrayElimCell_28)) (= (select |#valid| |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|) (_ bv1 1)))) (or (not (= |ULTIMATE.start_alloc_2_11_~client#1.base| |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|)) (= v_arrayElimCell_28 |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|))))} is VALID [2022-02-20 23:50:57,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {11839#(exists ((|ULTIMATE.start_alloc_2_11_~client#1.base| (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (and (or (and (= (_ bv1 1) (select |#valid| v_arrayElimCell_28)) (= (select |#valid| |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_2_11_~client#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|) (_ bv1 1)))) (or (not (= |ULTIMATE.start_alloc_2_11_~client#1.base| |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|)) (= v_arrayElimCell_28 |ULTIMATE.start_alloc_2_11_~cfg~0#1.base|))))} assume !(1bv1 == #valid[alloc_2_11_~cfg~0#1.base]); {11742#false} is VALID [2022-02-20 23:50:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:50:57,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:58,101 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-02-20 23:50:58,104 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 65 treesize of output 64 [2022-02-20 23:50:58,173 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:58,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066194363] [2022-02-20 23:50:58,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066194363] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:58,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1729915335] [2022-02-20 23:50:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:58,174 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:58,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-02-20 23:50:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:58,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:50:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:58,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:58,314 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:50:58,493 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:58,493 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:50:58,588 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