./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_test22_5.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 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:34:45,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:34:45,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:34:45,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:34:45,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:34:45,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:34:45,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:34:45,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:34:45,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:34:45,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:34:45,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:34:45,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:34:45,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:34:45,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:34:45,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:34:45,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:34:45,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:34:45,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:34:45,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:34:45,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:34:45,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:34:45,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:34:45,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:34:45,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:34:45,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:34:45,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:34:45,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:34:45,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:34:45,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:34:45,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:34:45,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:34:45,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:34:45,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:34:45,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:34:45,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:34:45,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:34:45,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:34:45,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:34:45,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:34:45,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:34:45,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:34:45,890 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:34:45,917 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:34:45,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:34:45,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:34:45,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:34:45,919 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:34:45,919 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:34:45,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:34:45,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:34:45,919 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:34:45,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:34:45,920 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:34:45,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:34:45,922 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:34:45,922 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:34:45,922 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:34:45,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:34:45,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:34:45,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:34:45,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:34:45,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:34:45,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:34:45,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:34:45,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:34:45,924 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:34:45,924 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:34:45,924 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:34:45,924 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:34:45,924 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2023-02-17 08:34:46,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:34:46,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:34:46,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:34:46,123 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:34:46,123 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:34:46,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2023-02-17 08:34:47,230 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:34:47,429 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:34:47,429 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2023-02-17 08:34:47,438 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aca934b2/e82b4d3c9b8f4827b8df31a8b67663f9/FLAGe83ca4c5e [2023-02-17 08:34:47,450 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aca934b2/e82b4d3c9b8f4827b8df31a8b67663f9 [2023-02-17 08:34:47,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:34:47,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:34:47,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:34:47,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:34:47,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:34:47,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:34:47" (1/1) ... [2023-02-17 08:34:47,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462bf936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:47, skipping insertion in model container [2023-02-17 08:34:47,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:34:47" (1/1) ... [2023-02-17 08:34:47,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:34:47,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:34:47,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:34:47,752 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-17 08:34:47,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@639e025b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:47, skipping insertion in model container [2023-02-17 08:34:47,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:34:47,754 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 08:34:47,755 INFO L158 Benchmark]: Toolchain (without parser) took 301.92ms. Allocated memory is still 121.6MB. Free memory was 75.1MB in the beginning and 61.4MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:34:47,756 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:34:47,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.17ms. Allocated memory is still 121.6MB. Free memory was 74.8MB in the beginning and 61.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:34:47,758 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.17ms. Allocated memory is still 121.6MB. Free memory was 74.8MB in the beginning and 61.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. 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 of different sizes 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 -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_test22_5.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 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:34:49,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:34:49,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:34:49,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:34:49,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:34:49,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:34:49,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:34:49,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:34:49,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:34:49,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:34:49,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:34:49,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:34:49,462 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:34:49,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:34:49,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:34:49,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:34:49,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:34:49,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:34:49,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:34:49,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:34:49,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:34:49,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:34:49,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:34:49,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:34:49,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:34:49,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:34:49,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:34:49,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:34:49,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:34:49,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:34:49,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:34:49,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:34:49,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:34:49,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:34:49,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:34:49,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:34:49,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:34:49,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:34:49,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:34:49,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:34:49,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:34:49,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 08:34:49,519 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:34:49,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:34:49,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:34:49,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:34:49,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:34:49,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:34:49,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:34:49,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:34:49,522 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:34:49,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:34:49,523 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:34:49,523 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:34:49,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:34:49,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:34:49,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:34:49,524 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:34:49,524 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:34:49,524 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:34:49,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:34:49,525 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:34:49,525 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:34:49,525 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:34:49,525 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:34:49,525 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:34:49,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:34:49,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:34:49,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:34:49,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:34:49,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:34:49,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:34:49,527 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:34:49,527 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:34:49,527 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:34:49,527 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:34:49,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:34:49,528 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:34:49,528 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:34:49,528 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2023-02-17 08:34:49,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:34:49,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:34:49,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:34:49,907 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:34:49,907 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:34:49,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2023-02-17 08:34:51,000 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:34:51,229 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:34:51,229 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2023-02-17 08:34:51,241 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc10a826/37baaa33da9d42618687e4bbe3706d4a/FLAG31358605c [2023-02-17 08:34:51,583 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc10a826/37baaa33da9d42618687e4bbe3706d4a [2023-02-17 08:34:51,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:34:51,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:34:51,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:34:51,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:34:51,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:34:51,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:34:51" (1/1) ... [2023-02-17 08:34:51,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679a9ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:51, skipping insertion in model container [2023-02-17 08:34:51,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:34:51" (1/1) ... [2023-02-17 08:34:51,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:34:51,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:34:51,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:34:51,959 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 08:34:51,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:34:52,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:34:52,027 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:34:52,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:34:52,101 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:34:52,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52 WrapperNode [2023-02-17 08:34:52,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:34:52,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:34:52,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:34:52,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:34:52,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,166 INFO L138 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 15, statements flattened = 102 [2023-02-17 08:34:52,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:34:52,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:34:52,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:34:52,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:34:52,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,214 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:34:52,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:34:52,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:34:52,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:34:52,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (1/1) ... [2023-02-17 08:34:52,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:34:52,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:34:52,294 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) [2023-02-17 08:34:52,345 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 [2023-02-17 08:34:52,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 08:34:52,354 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-17 08:34:52,355 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-17 08:34:52,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-17 08:34:52,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-17 08:34:52,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2023-02-17 08:34:52,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2023-02-17 08:34:52,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:34:52,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:34:52,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:34:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:34:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 08:34:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:34:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 08:34:52,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:34:52,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:34:52,518 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:34:52,520 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:34:52,761 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:34:52,765 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:34:52,765 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 08:34:52,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:34:52 BoogieIcfgContainer [2023-02-17 08:34:52,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:34:52,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:34:52,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:34:52,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:34:52,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:34:51" (1/3) ... [2023-02-17 08:34:52,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:34:52, skipping insertion in model container [2023-02-17 08:34:52,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:34:52" (2/3) ... [2023-02-17 08:34:52,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:34:52, skipping insertion in model container [2023-02-17 08:34:52,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:34:52" (3/3) ... [2023-02-17 08:34:52,772 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2023-02-17 08:34:52,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:34:52,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2023-02-17 08:34:52,833 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:34:52,839 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4dc2e393, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:34:52,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-02-17 08:34:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 71 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:34:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:34:52,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:52,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:52,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash -544283271, now seen corresponding path program 1 times [2023-02-17 08:34:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:52,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491076875] [2023-02-17 08:34:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:52,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:52,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:52,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:52,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 08:34:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:52,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:34:52,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:52,976 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:34:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:52,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:52,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:52,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491076875] [2023-02-17 08:34:52,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491076875] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:52,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:52,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:34:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426902624] [2023-02-17 08:34:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:52,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:34:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:53,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:34:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:34:53,018 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 71 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-02-17 08:34:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:53,228 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2023-02-17 08:34:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:34:53,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2023-02-17 08:34:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:53,235 INFO L225 Difference]: With dead ends: 102 [2023-02-17 08:34:53,235 INFO L226 Difference]: Without dead ends: 100 [2023-02-17 08:34:53,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:34:53,239 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:53,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 288 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:34:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-17 08:34:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2023-02-17 08:34:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 73 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 08:34:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-02-17 08:34:53,273 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 10 [2023-02-17 08:34:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:53,273 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-02-17 08:34:53,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2023-02-17 08:34:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-02-17 08:34:53,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:34:53,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:53,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:53,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:53,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:53,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -515654120, now seen corresponding path program 1 times [2023-02-17 08:34:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:53,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033498919] [2023-02-17 08:34:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:53,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:53,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:53,485 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:53,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 08:34:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:53,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:34:53,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:53,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:53,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:53,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033498919] [2023-02-17 08:34:53,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033498919] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:53,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:53,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:34:53,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772371347] [2023-02-17 08:34:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:53,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:34:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:34:53,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:34:53,620 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-02-17 08:34:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:53,655 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-02-17 08:34:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:34:53,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2023-02-17 08:34:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:53,656 INFO L225 Difference]: With dead ends: 86 [2023-02-17 08:34:53,656 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 08:34:53,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:34:53,657 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:53,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 333 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:34:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 08:34:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2023-02-17 08:34:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 71 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 08:34:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-02-17 08:34:53,684 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 10 [2023-02-17 08:34:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:53,684 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-02-17 08:34:53,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-02-17 08:34:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-02-17 08:34:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 08:34:53,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:53,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:53,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:53,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash 307087832, now seen corresponding path program 1 times [2023-02-17 08:34:53,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:53,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474989113] [2023-02-17 08:34:53,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:53,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:53,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:53,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 08:34:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:53,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:34:53,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:53,957 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:34:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:53,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:53,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:53,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474989113] [2023-02-17 08:34:53,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474989113] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:53,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:53,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:34:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401612649] [2023-02-17 08:34:53,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:53,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:34:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:53,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:34:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:34:53,981 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2023-02-17 08:34:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:54,213 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-02-17 08:34:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:34:54,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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 [2023-02-17 08:34:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:54,217 INFO L225 Difference]: With dead ends: 92 [2023-02-17 08:34:54,217 INFO L226 Difference]: Without dead ends: 92 [2023-02-17 08:34:54,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:34:54,218 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:54,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 359 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:34:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-17 08:34:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2023-02-17 08:34:54,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 08:34:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-02-17 08:34:54,223 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 11 [2023-02-17 08:34:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:54,224 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-02-17 08:34:54,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 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) [2023-02-17 08:34:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-02-17 08:34:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 08:34:54,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:54,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:54,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:54,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:54,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 149796357, now seen corresponding path program 1 times [2023-02-17 08:34:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298196372] [2023-02-17 08:34:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:54,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:54,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:54,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 08:34:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:54,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:34:54,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:54,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:54,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:54,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298196372] [2023-02-17 08:34:54,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298196372] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:54,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:54,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:34:54,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538233862] [2023-02-17 08:34:54,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:54,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:34:54,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:54,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:34:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:34:54,531 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:54,547 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-02-17 08:34:54,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:34:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-17 08:34:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:54,548 INFO L225 Difference]: With dead ends: 85 [2023-02-17 08:34:54,548 INFO L226 Difference]: Without dead ends: 85 [2023-02-17 08:34:54,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:34:54,549 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 20 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 318 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 [2023-02-17 08:34:54,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 318 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:34:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-17 08:34:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2023-02-17 08:34:54,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-17 08:34:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2023-02-17 08:34:54,554 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 14 [2023-02-17 08:34:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:54,555 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2023-02-17 08:34:54,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2023-02-17 08:34:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 08:34:54,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:54,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:54,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:54,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:54,767 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -46717148, now seen corresponding path program 1 times [2023-02-17 08:34:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:54,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595357104] [2023-02-17 08:34:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:54,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:54,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:54,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:54,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 08:34:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:54,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:34:54,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:54,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:54,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:54,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595357104] [2023-02-17 08:34:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595357104] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:54,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:54,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:34:54,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195214655] [2023-02-17 08:34:54,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:34:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:34:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:34:54,844 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:54,874 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-02-17 08:34:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:34:54,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-02-17 08:34:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:54,875 INFO L225 Difference]: With dead ends: 91 [2023-02-17 08:34:54,875 INFO L226 Difference]: Without dead ends: 91 [2023-02-17 08:34:54,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:34:54,876 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:54,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 390 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:34:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-17 08:34:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2023-02-17 08:34:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 75 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:34:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2023-02-17 08:34:54,882 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2023-02-17 08:34:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:54,882 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2023-02-17 08:34:54,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2023-02-17 08:34:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:34:54,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:54,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:54,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:55,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:55,090 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash -945781721, now seen corresponding path program 1 times [2023-02-17 08:34:55,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:55,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696116503] [2023-02-17 08:34:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:55,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:55,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:55,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-17 08:34:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:55,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 08:34:55,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:55,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:55,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:55,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696116503] [2023-02-17 08:34:55,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696116503] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:55,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:55,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:34:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898872045] [2023-02-17 08:34:55,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:55,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:34:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:34:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:34:55,207 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-02-17 08:34:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:55,230 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-02-17 08:34:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:34:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2023-02-17 08:34:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:55,231 INFO L225 Difference]: With dead ends: 90 [2023-02-17 08:34:55,233 INFO L226 Difference]: Without dead ends: 90 [2023-02-17 08:34:55,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:34:55,233 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:55,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:34:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-17 08:34:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2023-02-17 08:34:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 76 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:34:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-02-17 08:34:55,241 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2023-02-17 08:34:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:55,241 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-02-17 08:34:55,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-02-17 08:34:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-02-17 08:34:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:34:55,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:55,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:55,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-02-17 08:34:55,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:55,451 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 686278594, now seen corresponding path program 1 times [2023-02-17 08:34:55,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:55,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102121049] [2023-02-17 08:34:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:55,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:55,455 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:55,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 08:34:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:55,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:34:55,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:55,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:34:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:55,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:55,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102121049] [2023-02-17 08:34:55,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102121049] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:34:55,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:34:55,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-17 08:34:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504881999] [2023-02-17 08:34:55,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:34:55,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:34:55,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:34:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:34:55,538 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:55,584 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2023-02-17 08:34:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:34:55,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-17 08:34:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:55,600 INFO L225 Difference]: With dead ends: 93 [2023-02-17 08:34:55,600 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 08:34:55,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:34:55,601 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:55,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 387 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:34:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 08:34:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2023-02-17 08:34:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.423728813559322) internal successors, (84), 79 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:34:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-02-17 08:34:55,606 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 17 [2023-02-17 08:34:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:55,606 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-02-17 08:34:55,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-02-17 08:34:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 08:34:55,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:55,607 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:55,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:55,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:55,814 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1101750465, now seen corresponding path program 1 times [2023-02-17 08:34:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:55,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540520150] [2023-02-17 08:34:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:55,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:55,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:55,816 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:55,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 08:34:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:55,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:34:55,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:55,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:55,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:55,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540520150] [2023-02-17 08:34:55,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540520150] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:55,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:55,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:34:55,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894329598] [2023-02-17 08:34:55,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:55,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:34:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:34:55,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:34:55,884 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:34:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:55,916 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2023-02-17 08:34:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:34:55,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-02-17 08:34:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:55,917 INFO L225 Difference]: With dead ends: 99 [2023-02-17 08:34:55,918 INFO L226 Difference]: Without dead ends: 99 [2023-02-17 08:34:55,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:34:55,918 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:55,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 398 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:34:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-17 08:34:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2023-02-17 08:34:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 83 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 08:34:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2023-02-17 08:34:55,923 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 20 [2023-02-17 08:34:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:55,923 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2023-02-17 08:34:55,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:34:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2023-02-17 08:34:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 08:34:55,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:55,924 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:55,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:56,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:56,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473369, now seen corresponding path program 2 times [2023-02-17 08:34:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:56,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90856147] [2023-02-17 08:34:56,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:34:56,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:56,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:56,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:56,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 08:34:56,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 08:34:56,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:34:56,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:34:56,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:56,189 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:34:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 08:34:56,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:56,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:56,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90856147] [2023-02-17 08:34:56,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90856147] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:56,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:56,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 08:34:56,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083513128] [2023-02-17 08:34:56,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:56,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:34:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:34:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:34:56,217 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:56,397 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2023-02-17 08:34:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:34:56,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-02-17 08:34:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:56,400 INFO L225 Difference]: With dead ends: 100 [2023-02-17 08:34:56,400 INFO L226 Difference]: Without dead ends: 100 [2023-02-17 08:34:56,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:34:56,400 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:56,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 377 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:34:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-17 08:34:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2023-02-17 08:34:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.380952380952381) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 08:34:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2023-02-17 08:34:56,404 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 20 [2023-02-17 08:34:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:56,404 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2023-02-17 08:34:56,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2023-02-17 08:34:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 08:34:56,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:56,404 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:56,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:56,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:56,612 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473368, now seen corresponding path program 1 times [2023-02-17 08:34:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:56,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264965609] [2023-02-17 08:34:56,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:56,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:56,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:56,614 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:56,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-17 08:34:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:56,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:34:56,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:56,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:34:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:56,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:56,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264965609] [2023-02-17 08:34:56,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264965609] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:34:56,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:34:56,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-02-17 08:34:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853386938] [2023-02-17 08:34:56,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:34:56,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:34:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:34:56,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:34:56,829 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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) [2023-02-17 08:34:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:56,950 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-02-17 08:34:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:34:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 20 [2023-02-17 08:34:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:56,951 INFO L225 Difference]: With dead ends: 102 [2023-02-17 08:34:56,951 INFO L226 Difference]: Without dead ends: 102 [2023-02-17 08:34:56,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2023-02-17 08:34:56,951 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 44 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:56,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 563 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:34:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-17 08:34:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2023-02-17 08:34:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 88 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-17 08:34:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2023-02-17 08:34:56,955 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 20 [2023-02-17 08:34:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:56,955 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2023-02-17 08:34:56,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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) [2023-02-17 08:34:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2023-02-17 08:34:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 08:34:56,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:56,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:56,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-02-17 08:34:57,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:57,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:57,163 INFO L85 PathProgramCache]: Analyzing trace with hash -62141083, now seen corresponding path program 1 times [2023-02-17 08:34:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:57,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545408196] [2023-02-17 08:34:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:57,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:57,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:57,165 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:57,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 08:34:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:57,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:34:57,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 08:34:57,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:57,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:57,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545408196] [2023-02-17 08:34:57,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545408196] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:57,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:57,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:34:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911343822] [2023-02-17 08:34:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:57,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:34:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:57,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:34:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:34:57,234 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 08:34:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:57,312 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2023-02-17 08:34:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:34:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-02-17 08:34:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:57,313 INFO L225 Difference]: With dead ends: 105 [2023-02-17 08:34:57,313 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 08:34:57,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:34:57,313 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:57,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 147 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:34:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 08:34:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-02-17 08:34:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.396551724137931) internal successors, (81), 76 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:34:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-17 08:34:57,316 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 23 [2023-02-17 08:34:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:57,316 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-17 08:34:57,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 08:34:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-17 08:34:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 08:34:57,316 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:57,316 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:57,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-02-17 08:34:57,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:57,523 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:57,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2043849464, now seen corresponding path program 2 times [2023-02-17 08:34:57,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:57,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420152264] [2023-02-17 08:34:57,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:34:57,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:57,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:57,525 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:57,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 08:34:57,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 08:34:57,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:34:57,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 08:34:57,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:57,593 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:34:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-17 08:34:57,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:57,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:57,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420152264] [2023-02-17 08:34:57,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420152264] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:57,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:57,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 08:34:57,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292494474] [2023-02-17 08:34:57,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:57,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 08:34:57,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:57,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 08:34:57,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:34:57,637 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:57,874 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-02-17 08:34:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:34:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-17 08:34:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:57,876 INFO L225 Difference]: With dead ends: 99 [2023-02-17 08:34:57,876 INFO L226 Difference]: Without dead ends: 99 [2023-02-17 08:34:57,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:34:57,876 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:57,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 441 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:34:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-17 08:34:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2023-02-17 08:34:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 75 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:34:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2023-02-17 08:34:57,879 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 26 [2023-02-17 08:34:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:57,879 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2023-02-17 08:34:57,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2023-02-17 08:34:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 08:34:57,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:57,879 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:57,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:58,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:58,086 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1441027708, now seen corresponding path program 1 times [2023-02-17 08:34:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971481198] [2023-02-17 08:34:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:58,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:58,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:58,088 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:58,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 08:34:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:58,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:34:58,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:58,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:34:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:34:58,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:58,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971481198] [2023-02-17 08:34:58,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971481198] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:34:58,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:34:58,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-02-17 08:34:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786929473] [2023-02-17 08:34:58,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:34:58,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 08:34:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:58,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 08:34:58,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2023-02-17 08:34:58,579 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:58,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:58,849 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-02-17 08:34:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 08:34:58,849 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-02-17 08:34:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:58,850 INFO L225 Difference]: With dead ends: 88 [2023-02-17 08:34:58,850 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 08:34:58,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2023-02-17 08:34:58,850 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:58,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 984 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:34:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 08:34:58,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-17 08:34:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:34:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-17 08:34:58,852 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 30 [2023-02-17 08:34:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:58,852 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-17 08:34:58,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-17 08:34:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 08:34:58,853 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:58,853 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:58,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:59,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:59,062 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107868, now seen corresponding path program 2 times [2023-02-17 08:34:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:59,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318597555] [2023-02-17 08:34:59,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:34:59,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:59,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:59,065 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:59,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 08:34:59,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 08:34:59,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:34:59,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 08:34:59,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:59,161 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:34:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:34:59,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:59,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:59,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318597555] [2023-02-17 08:34:59,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318597555] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:59,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:59,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 08:34:59,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756439836] [2023-02-17 08:34:59,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:59,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:34:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:59,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:34:59,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:34:59,227 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:34:59,461 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2023-02-17 08:34:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:34:59,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-02-17 08:34:59,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:34:59,462 INFO L225 Difference]: With dead ends: 94 [2023-02-17 08:34:59,462 INFO L226 Difference]: Without dead ends: 94 [2023-02-17 08:34:59,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:34:59,462 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:34:59,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 442 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:34:59,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-17 08:34:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2023-02-17 08:34:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 79 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:34:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-17 08:34:59,465 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 36 [2023-02-17 08:34:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:34:59,465 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-17 08:34:59,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:34:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-17 08:34:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 08:34:59,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:34:59,465 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:34:59,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-17 08:34:59,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:59,674 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:34:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:34:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107867, now seen corresponding path program 1 times [2023-02-17 08:34:59,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:34:59,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330861704] [2023-02-17 08:34:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:34:59,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:34:59,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:34:59,677 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:34:59,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-17 08:34:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:34:59,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:34:59,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:34:59,804 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:34:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:34:59,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:34:59,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:34:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330861704] [2023-02-17 08:34:59,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330861704] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:34:59,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:34:59,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 08:34:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219351792] [2023-02-17 08:34:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:34:59,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 08:34:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:34:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 08:34:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:34:59,841 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:35:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:00,023 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2023-02-17 08:35:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:35:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-02-17 08:35:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:00,024 INFO L225 Difference]: With dead ends: 87 [2023-02-17 08:35:00,024 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 08:35:00,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:35:00,025 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:00,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:35:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 08:35:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-02-17 08:35:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-17 08:35:00,027 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 36 [2023-02-17 08:35:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:00,027 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-17 08:35:00,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:35:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-17 08:35:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 08:35:00,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:00,028 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:00,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:00,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:00,229 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:00,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash 94582189, now seen corresponding path program 1 times [2023-02-17 08:35:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:00,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772306821] [2023-02-17 08:35:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:00,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:00,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:00,230 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:00,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 08:35:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:00,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:35:00,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:00,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:00,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:00,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772306821] [2023-02-17 08:35:00,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772306821] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:00,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:00,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:35:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233598406] [2023-02-17 08:35:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:00,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:35:00,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:35:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:35:00,373 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:35:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:00,395 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2023-02-17 08:35:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:35:00,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-02-17 08:35:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:00,396 INFO L225 Difference]: With dead ends: 84 [2023-02-17 08:35:00,396 INFO L226 Difference]: Without dead ends: 84 [2023-02-17 08:35:00,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:35:00,397 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:00,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 306 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:35:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-17 08:35:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-17 08:35:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.265625) internal successors, (81), 77 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-02-17 08:35:00,400 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 36 [2023-02-17 08:35:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:00,401 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-02-17 08:35:00,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:35:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-02-17 08:35:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 08:35:00,401 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:00,401 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:00,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:00,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:00,610 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:00,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2072333273, now seen corresponding path program 1 times [2023-02-17 08:35:00,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:00,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980301271] [2023-02-17 08:35:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:00,612 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:00,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-17 08:35:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:00,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:35:00,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:00,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:00,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:00,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980301271] [2023-02-17 08:35:00,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980301271] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:00,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:00,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 08:35:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179004545] [2023-02-17 08:35:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:00,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:35:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:35:00,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:35:00,760 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:35:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:00,795 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2023-02-17 08:35:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:35:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-02-17 08:35:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:00,796 INFO L225 Difference]: With dead ends: 84 [2023-02-17 08:35:00,796 INFO L226 Difference]: Without dead ends: 84 [2023-02-17 08:35:00,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:35:00,796 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:00,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 351 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:35:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-17 08:35:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-17 08:35:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.25) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2023-02-17 08:35:00,800 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 38 [2023-02-17 08:35:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:00,801 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2023-02-17 08:35:00,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:35:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2023-02-17 08:35:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:35:00,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:00,802 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:00,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:01,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:01,028 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:01,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293974, now seen corresponding path program 1 times [2023-02-17 08:35:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:01,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25816904] [2023-02-17 08:35:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:01,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:01,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:01,037 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:01,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 08:35:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:01,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 08:35:01,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:01,205 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:01,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:01,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25816904] [2023-02-17 08:35:01,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25816904] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:01,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:01,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-17 08:35:01,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740875917] [2023-02-17 08:35:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:01,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 08:35:01,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:01,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 08:35:01,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:35:01,278 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:01,589 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2023-02-17 08:35:01,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:35:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2023-02-17 08:35:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:01,590 INFO L225 Difference]: With dead ends: 125 [2023-02-17 08:35:01,590 INFO L226 Difference]: Without dead ends: 125 [2023-02-17 08:35:01,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-02-17 08:35:01,591 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 103 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:01,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 341 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:35:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-17 08:35:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2023-02-17 08:35:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 94 states have internal predecessors, (102), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-17 08:35:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-17 08:35:01,594 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 46 [2023-02-17 08:35:01,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:01,594 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-17 08:35:01,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-17 08:35:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:35:01,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:01,594 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:01,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:01,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:01,795 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:01,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293975, now seen corresponding path program 1 times [2023-02-17 08:35:01,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:01,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393498497] [2023-02-17 08:35:01,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:01,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:01,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:01,797 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:01,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-17 08:35:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:01,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 08:35:01,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:01,970 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:02,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:02,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:02,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393498497] [2023-02-17 08:35:02,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393498497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:02,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:02,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 08:35:02,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648993634] [2023-02-17 08:35:02,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:02,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:35:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:35:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:35:02,052 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:02,383 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2023-02-17 08:35:02,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:35:02,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2023-02-17 08:35:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:02,384 INFO L225 Difference]: With dead ends: 131 [2023-02-17 08:35:02,384 INFO L226 Difference]: Without dead ends: 131 [2023-02-17 08:35:02,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:35:02,385 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 151 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:02,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 426 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:35:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-17 08:35:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2023-02-17 08:35:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 98 states have internal predecessors, (113), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2023-02-17 08:35:02,387 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 46 [2023-02-17 08:35:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:02,388 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2023-02-17 08:35:02,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2023-02-17 08:35:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 08:35:02,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:02,388 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:02,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:02,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:02,598 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash -882834383, now seen corresponding path program 1 times [2023-02-17 08:35:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:02,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859354079] [2023-02-17 08:35:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:02,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:02,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:02,600 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:02,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-17 08:35:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:02,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:35:02,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:02,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:02,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:02,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859354079] [2023-02-17 08:35:02,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859354079] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:02,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:02,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 08:35:02,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077277179] [2023-02-17 08:35:02,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:02,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 08:35:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:02,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 08:35:02,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:35:02,803 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:02,859 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2023-02-17 08:35:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:35:02,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2023-02-17 08:35:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:02,861 INFO L225 Difference]: With dead ends: 111 [2023-02-17 08:35:02,861 INFO L226 Difference]: Without dead ends: 109 [2023-02-17 08:35:02,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:35:02,861 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:02,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 425 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:35:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-17 08:35:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-02-17 08:35:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 98 states have internal predecessors, (112), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2023-02-17 08:35:02,863 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 52 [2023-02-17 08:35:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:02,863 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2023-02-17 08:35:02,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2023-02-17 08:35:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 08:35:02,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:02,868 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:02,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-02-17 08:35:03,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:03,069 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:03,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:03,069 INFO L85 PathProgramCache]: Analyzing trace with hash -644390150, now seen corresponding path program 1 times [2023-02-17 08:35:03,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:03,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032837470] [2023-02-17 08:35:03,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:03,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:03,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:03,071 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:03,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-17 08:35:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:03,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 08:35:03,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:03,294 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:03,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:03,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032837470] [2023-02-17 08:35:03,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032837470] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:03,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:03,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 08:35:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46328506] [2023-02-17 08:35:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:35:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:35:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:35:03,363 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:03,679 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2023-02-17 08:35:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 08:35:03,679 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2023-02-17 08:35:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:03,680 INFO L225 Difference]: With dead ends: 127 [2023-02-17 08:35:03,680 INFO L226 Difference]: Without dead ends: 127 [2023-02-17 08:35:03,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:35:03,680 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:03,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 286 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:35:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-17 08:35:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2023-02-17 08:35:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 97 states have internal predecessors, (109), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2023-02-17 08:35:03,683 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 52 [2023-02-17 08:35:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:03,683 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2023-02-17 08:35:03,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2023-02-17 08:35:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 08:35:03,683 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:03,683 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:03,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:03,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:03,893 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash -644390149, now seen corresponding path program 1 times [2023-02-17 08:35:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:03,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58345174] [2023-02-17 08:35:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:03,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:03,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:03,896 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:03,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 08:35:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:04,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-17 08:35:04,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:04,141 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:04,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:04,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:04,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58345174] [2023-02-17 08:35:04,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58345174] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:04,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:04,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-17 08:35:04,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771762310] [2023-02-17 08:35:04,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:04,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:35:04,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:04,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:35:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:35:04,243 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:04,607 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2023-02-17 08:35:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:35:04,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2023-02-17 08:35:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:04,616 INFO L225 Difference]: With dead ends: 114 [2023-02-17 08:35:04,617 INFO L226 Difference]: Without dead ends: 114 [2023-02-17 08:35:04,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-02-17 08:35:04,617 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:04,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 438 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:35:04,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-17 08:35:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2023-02-17 08:35:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 97 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2023-02-17 08:35:04,619 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 52 [2023-02-17 08:35:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:04,619 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2023-02-17 08:35:04,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2023-02-17 08:35:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-17 08:35:04,620 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:04,620 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:04,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:04,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:04,834 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1476913121, now seen corresponding path program 1 times [2023-02-17 08:35:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:04,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912716963] [2023-02-17 08:35:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:04,836 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:04,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-17 08:35:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:05,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 08:35:05,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:05,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:05,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:05,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912716963] [2023-02-17 08:35:05,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912716963] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:05,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:05,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 08:35:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572649394] [2023-02-17 08:35:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:05,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:35:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:35:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:35:05,300 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:05,566 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2023-02-17 08:35:05,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:35:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2023-02-17 08:35:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:05,567 INFO L225 Difference]: With dead ends: 113 [2023-02-17 08:35:05,567 INFO L226 Difference]: Without dead ends: 113 [2023-02-17 08:35:05,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:35:05,567 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 176 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:05,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 464 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:35:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-17 08:35:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2023-02-17 08:35:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 97 states have internal predecessors, (106), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2023-02-17 08:35:05,569 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 55 [2023-02-17 08:35:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:05,569 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2023-02-17 08:35:05,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:35:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2023-02-17 08:35:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 08:35:05,570 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:05,570 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:05,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:05,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:05,770 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1073931710, now seen corresponding path program 1 times [2023-02-17 08:35:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:05,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550445125] [2023-02-17 08:35:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:05,772 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:05,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-17 08:35:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:06,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-17 08:35:06,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:06,113 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-02-17 08:35:06,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:06,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:06,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:06,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:06,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:06,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:06,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:06,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:06,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-02-17 08:35:06,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-02-17 08:35:06,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2023-02-17 08:35:06,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:06,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:06,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:06,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-02-17 08:35:06,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2023-02-17 08:35:06,708 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1615 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1615)))) is different from true [2023-02-17 08:35:06,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-02-17 08:35:06,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:06,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-17 08:35:06,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:35:06,931 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2023-02-17 08:35:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:35:06,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:35:07,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:07,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550445125] [2023-02-17 08:35:07,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550445125] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:35:07,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2095038372] [2023-02-17 08:35:07,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:07,763 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:35:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:35:07,777 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:35:07,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-17 08:35:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:08,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-17 08:35:08,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:08,278 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-02-17 08:35:08,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:08,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:08,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:08,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-02-17 08:35:08,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2023-02-17 08:35:08,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:08,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-17 08:35:08,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-02-17 08:35:08,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:08,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2023-02-17 08:35:08,603 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1810 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1810)))) is different from true [2023-02-17 08:35:08,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2023-02-17 08:35:08,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-17 08:35:08,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:35:08,740 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2023-02-17 08:35:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:35:08,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:35:10,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2095038372] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:35:10,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:35:10,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 44 [2023-02-17 08:35:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882806078] [2023-02-17 08:35:10,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:35:10,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-17 08:35:10,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:10,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-17 08:35:10,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3198, Unknown=2, NotChecked=230, Total=3660 [2023-02-17 08:35:10,088 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 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) [2023-02-17 08:35:12,484 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) (and (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1615 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store .cse0 |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) .cse1 v_ArrVal_1615)))) (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1810 (_ BitVec 32))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store .cse0 |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_1613) .cse1 v_ArrVal_1810)))))) is different from true [2023-02-17 08:35:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:13,341 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2023-02-17 08:35:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-17 08:35:13,342 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 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 58 [2023-02-17 08:35:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:13,343 INFO L225 Difference]: With dead ends: 121 [2023-02-17 08:35:13,343 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 08:35:13,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 80 SyntacticMatches, 15 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=561, Invalid=7458, Unknown=3, NotChecked=534, Total=8556 [2023-02-17 08:35:13,344 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:13,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1003 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1528 Invalid, 0 Unknown, 238 Unchecked, 2.1s Time] [2023-02-17 08:35:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 08:35:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2023-02-17 08:35:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.206896551724138) internal successors, (105), 97 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:35:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2023-02-17 08:35:13,347 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 58 [2023-02-17 08:35:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:13,347 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2023-02-17 08:35:13,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 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) [2023-02-17 08:35:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2023-02-17 08:35:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 08:35:13,347 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:13,347 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:13,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:13,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:13,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:13,748 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:13,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896519, now seen corresponding path program 1 times [2023-02-17 08:35:13,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:13,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050476928] [2023-02-17 08:35:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:13,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:13,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:13,750 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:13,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-17 08:35:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:14,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 08:35:14,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:14,023 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:14,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:35:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:14,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:14,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050476928] [2023-02-17 08:35:14,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050476928] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:35:14,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:35:14,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2023-02-17 08:35:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986862865] [2023-02-17 08:35:14,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:35:14,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:35:14,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:14,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:35:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:35:14,114 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:35:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:14,468 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2023-02-17 08:35:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 08:35:14,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 60 [2023-02-17 08:35:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:14,469 INFO L225 Difference]: With dead ends: 149 [2023-02-17 08:35:14,469 INFO L226 Difference]: Without dead ends: 149 [2023-02-17 08:35:14,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-02-17 08:35:14,470 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 165 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:14,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 351 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:35:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-17 08:35:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 128. [2023-02-17 08:35:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 08:35:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2023-02-17 08:35:14,472 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 60 [2023-02-17 08:35:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:14,472 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2023-02-17 08:35:14,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:35:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2023-02-17 08:35:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 08:35:14,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:14,473 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:14,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:14,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:14,683 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896518, now seen corresponding path program 1 times [2023-02-17 08:35:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:14,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962294540] [2023-02-17 08:35:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:14,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:14,686 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:14,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-17 08:35:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:14,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 08:35:14,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:14,946 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:15,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:15,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:15,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962294540] [2023-02-17 08:35:15,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962294540] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:15,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:15,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 08:35:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683324288] [2023-02-17 08:35:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:15,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:35:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:15,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:35:15,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:35:15,099 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:15,404 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2023-02-17 08:35:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:35:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2023-02-17 08:35:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:15,405 INFO L225 Difference]: With dead ends: 132 [2023-02-17 08:35:15,405 INFO L226 Difference]: Without dead ends: 132 [2023-02-17 08:35:15,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:35:15,405 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 130 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:15,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 551 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:35:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-17 08:35:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2023-02-17 08:35:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 115 states have internal predecessors, (123), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 08:35:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2023-02-17 08:35:15,408 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 60 [2023-02-17 08:35:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:15,408 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2023-02-17 08:35:15,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2023-02-17 08:35:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-17 08:35:15,408 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:15,409 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:15,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:15,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:15,609 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1067855226, now seen corresponding path program 1 times [2023-02-17 08:35:15,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:15,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694583729] [2023-02-17 08:35:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:15,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:15,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:15,611 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:15,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-17 08:35:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:15,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-17 08:35:15,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:15,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 08:35:16,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:16,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:16,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:16,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:16,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:16,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:16,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:16,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2023-02-17 08:35:16,478 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2288)))) is different from true [2023-02-17 08:35:16,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2023-02-17 08:35:16,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:16,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-17 08:35:16,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:35:16,670 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2023-02-17 08:35:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:35:16,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:35:17,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:17,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694583729] [2023-02-17 08:35:17,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694583729] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:35:17,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [835915450] [2023-02-17 08:35:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:17,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:35:17,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:35:17,389 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:35:17,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-17 08:35:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:17,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-17 08:35:17,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:17,916 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 11 [2023-02-17 08:35:17,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:17,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:17,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:17,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:17,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:17,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:17,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:17,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:17,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:18,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-17 08:35:18,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-17 08:35:18,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:35:18,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2023-02-17 08:35:18,279 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2483 (_ BitVec 32)) (v_ArrVal_2286 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2483)))) is different from true [2023-02-17 08:35:18,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2023-02-17 08:35:18,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-17 08:35:18,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:35:18,414 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2023-02-17 08:35:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:35:18,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:35:19,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [835915450] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:35:19,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:35:19,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 46 [2023-02-17 08:35:19,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831845204] [2023-02-17 08:35:19,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:35:19,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-17 08:35:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:19,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-17 08:35:19,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3299, Unknown=2, NotChecked=234, Total=3782 [2023-02-17 08:35:19,869 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 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) [2023-02-17 08:35:21,417 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|)) (.cse1 (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) (and (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store .cse0 |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2286) .cse1 v_ArrVal_2288)))) (exists ((v_ArrVal_2483 (_ BitVec 32)) (v_ArrVal_2286 (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store .cse0 |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2286) .cse1 v_ArrVal_2483)))))) is different from true [2023-02-17 08:35:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:22,107 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2023-02-17 08:35:22,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-17 08:35:22,108 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 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 59 [2023-02-17 08:35:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:22,108 INFO L225 Difference]: With dead ends: 138 [2023-02-17 08:35:22,108 INFO L226 Difference]: Without dead ends: 137 [2023-02-17 08:35:22,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 81 SyntacticMatches, 17 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=482, Invalid=5379, Unknown=3, NotChecked=456, Total=6320 [2023-02-17 08:35:22,110 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 168 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:22,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 821 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1329 Invalid, 0 Unknown, 229 Unchecked, 1.7s Time] [2023-02-17 08:35:22,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-17 08:35:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2023-02-17 08:35:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 112 states have internal predecessors, (117), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 08:35:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2023-02-17 08:35:22,112 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 59 [2023-02-17 08:35:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:22,112 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2023-02-17 08:35:22,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 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) [2023-02-17 08:35:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2023-02-17 08:35:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-17 08:35:22,113 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:22,113 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:22,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:22,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:22,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 08:35:22,523 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1335956715, now seen corresponding path program 1 times [2023-02-17 08:35:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:22,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210071837] [2023-02-17 08:35:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:22,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:22,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:22,525 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:22,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-17 08:35:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:22,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:35:22,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-02-17 08:35:22,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:22,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:22,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210071837] [2023-02-17 08:35:22,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210071837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:22,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:22,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 08:35:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623822445] [2023-02-17 08:35:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:22,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 08:35:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 08:35:22,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:35:22,828 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 08:35:22,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:22,908 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2023-02-17 08:35:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:35:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 63 [2023-02-17 08:35:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:22,909 INFO L225 Difference]: With dead ends: 127 [2023-02-17 08:35:22,910 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 08:35:22,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:35:22,910 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:22,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 409 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:35:22,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 08:35:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-02-17 08:35:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.1274509803921569) internal successors, (115), 112 states have internal predecessors, (115), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 08:35:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2023-02-17 08:35:22,917 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 63 [2023-02-17 08:35:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:22,918 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2023-02-17 08:35:22,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 08:35:22,918 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2023-02-17 08:35:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-17 08:35:22,918 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:22,918 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:22,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:23,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:23,125 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:23,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836323, now seen corresponding path program 1 times [2023-02-17 08:35:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:23,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930516114] [2023-02-17 08:35:23,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:23,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:23,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:23,127 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:23,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-17 08:35:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:23,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 08:35:23,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:23,472 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:23,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:35:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:23,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:23,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930516114] [2023-02-17 08:35:23,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930516114] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:35:23,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:35:23,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2023-02-17 08:35:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727941399] [2023-02-17 08:35:23,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:35:23,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:35:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:35:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-02-17 08:35:23,564 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:35:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:24,614 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2023-02-17 08:35:24,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 08:35:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 66 [2023-02-17 08:35:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:24,615 INFO L225 Difference]: With dead ends: 137 [2023-02-17 08:35:24,615 INFO L226 Difference]: Without dead ends: 137 [2023-02-17 08:35:24,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2023-02-17 08:35:24,616 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 106 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:24,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 422 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 434 Invalid, 1 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 08:35:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-17 08:35:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2023-02-17 08:35:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 113 states have internal predecessors, (117), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 08:35:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2023-02-17 08:35:24,619 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 66 [2023-02-17 08:35:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:24,619 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2023-02-17 08:35:24,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:35:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2023-02-17 08:35:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-17 08:35:24,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:24,619 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:24,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:24,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:24,829 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:24,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836322, now seen corresponding path program 1 times [2023-02-17 08:35:24,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841783259] [2023-02-17 08:35:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:24,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:24,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:24,832 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:24,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-17 08:35:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:25,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-17 08:35:25,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:25,171 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 08:35:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:25,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:25,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:25,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841783259] [2023-02-17 08:35:25,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841783259] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:25,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:25,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-17 08:35:25,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287047352] [2023-02-17 08:35:25,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:25,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:35:25,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:35:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:35:25,293 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:25,691 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2023-02-17 08:35:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:35:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 66 [2023-02-17 08:35:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:25,692 INFO L225 Difference]: With dead ends: 122 [2023-02-17 08:35:25,692 INFO L226 Difference]: Without dead ends: 122 [2023-02-17 08:35:25,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-02-17 08:35:25,692 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 129 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:25,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 519 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:35:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-17 08:35:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-17 08:35:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.1067961165048543) internal successors, (114), 111 states have internal predecessors, (114), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 08:35:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2023-02-17 08:35:25,695 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 66 [2023-02-17 08:35:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:25,695 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2023-02-17 08:35:25,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2023-02-17 08:35:25,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-17 08:35:25,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:25,696 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:25,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:25,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:25,897 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:25,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:25,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1920971938, now seen corresponding path program 1 times [2023-02-17 08:35:25,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:25,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904070252] [2023-02-17 08:35:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:25,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:25,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:25,899 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:25,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-17 08:35:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:35:26,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 08:35:26,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:35:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-02-17 08:35:26,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:35:26,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:35:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904070252] [2023-02-17 08:35:26,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904070252] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:35:26,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:35:26,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 08:35:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580808775] [2023-02-17 08:35:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:35:26,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:35:26,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:35:26,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:35:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:35:26,413 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:35:26,648 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2023-02-17 08:35:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:35:26,649 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 69 [2023-02-17 08:35:26,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:35:26,650 INFO L225 Difference]: With dead ends: 121 [2023-02-17 08:35:26,650 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 08:35:26,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:35:26,650 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 121 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:35:26,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 510 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:35:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 08:35:26,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-17 08:35:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.0970873786407767) internal successors, (113), 110 states have internal predecessors, (113), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 08:35:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2023-02-17 08:35:26,652 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 69 [2023-02-17 08:35:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:35:26,653 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2023-02-17 08:35:26,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 08:35:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2023-02-17 08:35:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-02-17 08:35:26,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:35:26,654 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:26,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:26,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:26,861 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2023-02-17 08:35:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:35:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295794, now seen corresponding path program 1 times [2023-02-17 08:35:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:35:26,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304423731] [2023-02-17 08:35:26,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:35:26,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:26,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:35:26,863 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:35:26,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-17 08:35:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:35:27,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 08:35:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 08:35:27,515 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-17 08:35:27,515 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 08:35:27,516 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2023-02-17 08:35:27,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2023-02-17 08:35:27,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2023-02-17 08:35:27,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (15 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2023-02-17 08:35:27,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2023-02-17 08:35:27,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2023-02-17 08:35:27,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 21 remaining) [2023-02-17 08:35:27,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-02-17 08:35:27,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:35:27,735 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:35:27,738 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 08:35:27,745 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,745 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,746 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,746 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,746 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,746 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,746 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,746 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,747 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,747 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,747 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,748 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,749 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,750 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,751 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,751 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,751 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,751 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,751 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,751 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,752 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,753 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,754 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,755 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,755 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,755 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,757 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,758 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,758 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,758 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,758 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,758 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,758 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,758 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,759 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,759 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,762 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,763 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 08:35:27 BoogieIcfgContainer [2023-02-17 08:35:27,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 08:35:27,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 08:35:27,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 08:35:27,799 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 08:35:27,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:34:52" (3/4) ... [2023-02-17 08:35:27,801 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 08:35:27,803 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,803 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,804 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,805 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,805 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,805 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,805 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,805 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,806 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,807 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,808 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,808 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,808 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,808 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,808 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,816 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,816 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,817 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,818 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,819 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,820 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,821 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,821 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,821 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,822 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,822 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,823 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,823 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,823 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,823 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2023-02-17 08:35:27,823 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,823 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2023-02-17 08:35:27,853 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 08:35:27,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 08:35:27,854 INFO L158 Benchmark]: Toolchain (without parser) took 36268.87ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 44.3MB in the beginning and 110.5MB in the end (delta: -66.2MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2023-02-17 08:35:27,854 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 56.6MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:35:27,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.59ms. Allocated memory is still 69.2MB. Free memory was 44.0MB in the beginning and 31.4MB in the end (delta: 12.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2023-02-17 08:35:27,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.62ms. Allocated memory is still 69.2MB. Free memory was 31.4MB in the beginning and 46.4MB in the end (delta: -15.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2023-02-17 08:35:27,855 INFO L158 Benchmark]: Boogie Preprocessor took 54.91ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 43.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 08:35:27,855 INFO L158 Benchmark]: RCFGBuilder took 543.87ms. Allocated memory is still 69.2MB. Free memory was 43.9MB in the beginning and 24.1MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-17 08:35:27,855 INFO L158 Benchmark]: TraceAbstraction took 35028.84ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 23.4MB in the beginning and 36.7MB in the end (delta: -13.3MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. [2023-02-17 08:35:27,856 INFO L158 Benchmark]: Witness Printer took 56.55ms. Allocated memory is still 146.8MB. Free memory was 36.7MB in the beginning and 110.5MB in the end (delta: -73.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2023-02-17 08:35:27,856 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 56.6MB. Free memory is still 32.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.59ms. Allocated memory is still 69.2MB. Free memory was 44.0MB in the beginning and 31.4MB in the end (delta: 12.6MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.62ms. Allocated memory is still 69.2MB. Free memory was 31.4MB in the beginning and 46.4MB in the end (delta: -15.0MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.91ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 43.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 543.87ms. Allocated memory is still 69.2MB. Free memory was 43.9MB in the beginning and 24.1MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35028.84ms. Allocated memory was 69.2MB in the beginning and 146.8MB in the end (delta: 77.6MB). Free memory was 23.4MB in the beginning and 36.7MB in the end (delta: -13.3MB). Peak memory consumption was 63.4MB. Max. memory is 16.1GB. * Witness Printer took 56.55ms. Allocated memory is still 146.8MB. Free memory was 36.7MB in the beginning and 110.5MB in the end (delta: -73.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L770] CALL entry_point() [L764] struct ldv_kobject *kobj; [L765] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(*kobj))={2:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={1:0}, list={2:4}] [L540] list->next = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L541] list->prev = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L765] RET, EXPR ldv_kobject_create() [L765] kobj = ldv_kobject_create() [L766] CALL f_22_put(kobj) [L761] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=1] [L666] temp = v->counter [L667] temp -= i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L668] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L669] return temp; VAL [\old(i)=1, \result=0, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L675] CALL release(kref) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L707] CALL ldv_kobject_cleanup(kobj) [L699] EXPR kobj->name VAL [kobj={2:0}, kobj={2:0}, kobj->name={0:0}, ldv_global_msg_list={1:0}] [L699] char *name = kobj->name; [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) [L701] COND FALSE !(\read(*name)) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L707] RET ldv_kobject_cleanup(kobj) [L675] RET release(kref) [L676] return 1; VAL [\old(count)=1, \result=1, count=1, kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L761] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L766] RET f_22_put(kobj) [L767] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL ldv_kref_sub(kref, 1, release) [L674] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] v->counter - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 34.9s, OverallIterations: 32, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 2314 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2294 mSDsluCounter, 13569 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 467 IncrementalHoareTripleChecker+Unchecked, 11496 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7561 IncrementalHoareTripleChecker+Invalid, 8270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 2073 mSDtfsCounter, 7561 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1688 GetRequests, 1136 SyntacticMatches, 57 SemanticMatches, 495 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4400 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=25, InterpolantAutomatonStates: 372, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 262 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1367 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1453 ConstructedInterpolants, 122 QuantifiedInterpolants, 10556 SizeOfPredicates, 516 NumberOfNonLiveVariables, 8550 ConjunctsInSsa, 979 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 2544/3242 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-17 08:35:27,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)