./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 6c24879c 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-?-6c24879 [2022-07-12 18:56:52,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:56:52,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:56:52,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:56:52,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:56:52,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:56:52,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:56:52,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:56:52,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:56:52,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:56:52,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:56:52,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:56:52,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:56:52,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:56:52,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:56:52,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:56:52,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:56:52,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:56:52,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:56:52,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:56:52,104 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:56:52,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:56:52,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:56:52,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:56:52,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:56:52,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:56:52,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:56:52,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:56:52,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:56:52,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:56:52,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:56:52,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:56:52,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:56:52,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:56:52,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:56:52,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:56:52,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:56:52,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:56:52,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:56:52,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:56:52,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:56:52,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:56:52,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:56:52,158 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:56:52,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:56:52,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:56:52,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:56:52,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:56:52,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:56:52,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:56:52,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:56:52,161 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:56:52,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:56:52,162 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:56:52,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:56:52,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:56:52,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:56:52,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:56:52,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:56:52,163 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:56:52,164 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:56:52,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:56:52,165 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:56:52,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:56:52,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:56:52,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:56:52,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:56:52,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:56:52,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:52,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:56:52,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:56:52,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:56:52,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:56:52,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2022-07-12 18:56:52,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:56:52,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:56:52,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:56:52,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:56:52,412 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:56:52,412 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 [2022-07-12 18:56:52,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6388e5792/dfdc70754c92453bb742bd618c93b14c/FLAG87755d069 [2022-07-12 18:56:52,950 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:56:52,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-07-12 18:56:52,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6388e5792/dfdc70754c92453bb742bd618c93b14c/FLAG87755d069 [2022-07-12 18:56:53,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6388e5792/dfdc70754c92453bb742bd618c93b14c [2022-07-12 18:56:53,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:56:53,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:56:53,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:53,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:56:53,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:56:53,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:53" (1/1) ... [2022-07-12 18:56:53,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad0c465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:53, skipping insertion in model container [2022-07-12 18:56:53,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:53" (1/1) ... [2022-07-12 18:56:53,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:56:53,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:53,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:53,729 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) [2022-07-12 18:56:53,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1db3ac69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:53, skipping insertion in model container [2022-07-12 18:56:53,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:53,731 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-12 18:56:53,733 INFO L158 Benchmark]: Toolchain (without parser) took 459.57ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 53.9MB in the beginning and 80.4MB in the end (delta: -26.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 18:56:53,734 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:56:53,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.29ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 80.4MB in the end (delta: -26.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 18:56:53,736 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.17ms. Allocated memory is still 86.0MB. Free memory was 41.0MB in the beginning and 41.0MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.29ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 80.4MB in the end (delta: -26.7MB). Peak memory consumption was 6.3MB. 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-?-6c24879 [2022-07-12 18:56:55,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:56:55,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:56:55,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:56:55,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:56:55,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:56:55,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:56:55,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:56:55,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:56:55,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:56:55,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:56:55,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:56:55,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:56:55,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:56:55,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:56:55,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:56:55,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:56:55,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:56:55,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:56:55,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:56:55,544 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:56:55,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:56:55,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:56:55,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:56:55,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:56:55,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:56:55,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:56:55,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:56:55,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:56:55,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:56:55,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:56:55,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:56:55,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:56:55,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:56:55,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:56:55,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:56:55,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:56:55,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:56:55,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:56:55,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:56:55,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:56:55,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:56:55,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:56:55,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:56:55,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:56:55,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:56:55,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:56:55,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:56:55,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:56:55,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:56:55,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:56:55,604 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:56:55,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:56:55,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:56:55,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:56:55,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:56:55,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:56:55,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:56:55,606 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:56:55,606 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:56:55,606 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:56:55,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:56:55,607 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:56:55,607 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:56:55,607 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:56:55,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:56:55,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:56:55,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:56:55,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:56:55,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:56:55,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:55,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:56:55,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:56:55,609 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:56:55,609 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:56:55,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:56:55,609 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2022-07-12 18:56:55,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:56:55,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:56:55,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:56:55,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:56:55,938 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:56:55,939 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 [2022-07-12 18:56:56,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b8c5d5c/0f095b2a24444c04980db11f80cfaab2/FLAGe66e85a24 [2022-07-12 18:56:56,543 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:56:56,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-07-12 18:56:56,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b8c5d5c/0f095b2a24444c04980db11f80cfaab2/FLAGe66e85a24 [2022-07-12 18:56:56,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b8c5d5c/0f095b2a24444c04980db11f80cfaab2 [2022-07-12 18:56:56,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:56:56,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:56:57,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:57,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:56:57,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:56:57,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:56" (1/1) ... [2022-07-12 18:56:57,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee03d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57, skipping insertion in model container [2022-07-12 18:56:57,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:56:56" (1/1) ... [2022-07-12 18:56:57,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:56:57,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:57,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:57,427 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 18:56:57,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:56:57,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:57,502 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:56:57,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:56:57,603 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:56:57,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57 WrapperNode [2022-07-12 18:56:57,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:56:57,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:57,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:56:57,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:56:57,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,674 INFO L137 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 15, statements flattened = 102 [2022-07-12 18:56:57,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:56:57,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:56:57,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:56:57,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:56:57,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,704 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:56:57,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:56:57,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:56:57,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:56:57,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (1/1) ... [2022-07-12 18:56:57,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:56:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:56:57,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 18:56:57,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 18:56:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:56:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:57,794 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-12 18:56:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 18:56:57,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 18:56:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-12 18:56:57,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-12 18:56:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 18:56:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 18:56:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 18:56:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 18:56:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:56:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:56:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 18:56:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:56:57,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:56:57,955 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:56:57,957 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:56:58,300 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:56:58,307 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:56:58,308 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 18:56:58,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:58 BoogieIcfgContainer [2022-07-12 18:56:58,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:56:58,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:56:58,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:56:58,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:56:58,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:56:56" (1/3) ... [2022-07-12 18:56:58,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bda7ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:58, skipping insertion in model container [2022-07-12 18:56:58,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:56:57" (2/3) ... [2022-07-12 18:56:58,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bda7ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:56:58, skipping insertion in model container [2022-07-12 18:56:58,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:58" (3/3) ... [2022-07-12 18:56:58,317 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2022-07-12 18:56:58,330 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:56:58,330 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-07-12 18:56:58,366 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:56:58,371 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@258c84cc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2debcf09 [2022-07-12 18:56:58,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-07-12 18:56:58,375 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) [2022-07-12 18:56:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:58,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:58,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:58,385 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)] === [2022-07-12 18:56:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash -544283271, now seen corresponding path program 1 times [2022-07-12 18:56:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:58,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186465055] [2022-07-12 18:56:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:58,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:58,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:58,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:58,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 18:56:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:58,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:56:58,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:58,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:58,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:58,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:58,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186465055] [2022-07-12 18:56:58,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186465055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:58,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:58,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487547628] [2022-07-12 18:56:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:58,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:56:58,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:56:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:56:58,637 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) [2022-07-12 18:56:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:58,872 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-07-12 18:56:58,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:58,875 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 [2022-07-12 18:56:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:58,884 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:56:58,884 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:56:58,885 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 [2022-07-12 18:56:58,888 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2022-07-12 18:56:58,889 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] [2022-07-12 18:56:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:56:58,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2022-07-12 18:56:58,921 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) [2022-07-12 18:56:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-07-12 18:56:58,924 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 10 [2022-07-12 18:56:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:58,924 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-07-12 18:56:58,924 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) [2022-07-12 18:56:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-07-12 18:56:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:56:58,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:58,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:58,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:59,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:59,136 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)] === [2022-07-12 18:56:59,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash -515654120, now seen corresponding path program 1 times [2022-07-12 18:56:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:59,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086458606] [2022-07-12 18:56:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:59,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:59,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:59,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:59,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 18:56:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:59,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:56:59,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:59,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:59,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:59,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086458606] [2022-07-12 18:56:59,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086458606] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:59,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:59,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:56:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019202305] [2022-07-12 18:56:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:56:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:56:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:56:59,274 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) [2022-07-12 18:56:59,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:59,308 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-12 18:56:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:56:59,309 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 [2022-07-12 18:56:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:59,316 INFO L225 Difference]: With dead ends: 86 [2022-07-12 18:56:59,316 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 18:56:59,317 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 [2022-07-12 18:56:59,320 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 [2022-07-12 18:56:59,323 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] [2022-07-12 18:56:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 18:56:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-07-12 18:56:59,335 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) [2022-07-12 18:56:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-12 18:56:59,338 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 10 [2022-07-12 18:56:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:56:59,339 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-12 18:56:59,339 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) [2022-07-12 18:56:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-12 18:56:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:56:59,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:56:59,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:56:59,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 18:56:59,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:56:59,553 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)] === [2022-07-12 18:56:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:56:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash 307087832, now seen corresponding path program 1 times [2022-07-12 18:56:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:56:59,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546870354] [2022-07-12 18:56:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:56:59,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:56:59,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:56:59,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:56:59,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 18:56:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:56:59,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:56:59,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:56:59,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:56:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:56:59,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:56:59,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:56:59,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546870354] [2022-07-12 18:56:59,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546870354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:56:59,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:56:59,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:56:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364510457] [2022-07-12 18:56:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:56:59,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:56:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:56:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:56:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:56:59,725 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) [2022-07-12 18:56:59,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:56:59,994 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-07-12 18:56:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:56:59,995 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 [2022-07-12 18:56:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:56:59,996 INFO L225 Difference]: With dead ends: 92 [2022-07-12 18:56:59,996 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 18:56:59,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:56:59,997 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 [2022-07-12 18:56:59,998 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] [2022-07-12 18:56:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 18:57:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2022-07-12 18:57:00,008 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) [2022-07-12 18:57:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2022-07-12 18:57:00,009 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 11 [2022-07-12 18:57:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:00,010 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2022-07-12 18:57:00,010 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) [2022-07-12 18:57:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-07-12 18:57:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:57:00,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:00,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:00,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 18:57:00,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:00,232 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)] === [2022-07-12 18:57:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:00,232 INFO L85 PathProgramCache]: Analyzing trace with hash 149796357, now seen corresponding path program 1 times [2022-07-12 18:57:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175793123] [2022-07-12 18:57:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:00,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:00,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:00,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:00,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 18:57:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:00,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:57:00,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:00,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:00,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:00,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175793123] [2022-07-12 18:57:00,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175793123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:00,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:00,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:57:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990736941] [2022-07-12 18:57:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:57:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:57:00,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:57:00,357 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) [2022-07-12 18:57:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:00,387 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-07-12 18:57:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:57:00,387 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 [2022-07-12 18:57:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:00,389 INFO L225 Difference]: With dead ends: 85 [2022-07-12 18:57:00,389 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 18:57:00,390 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 [2022-07-12 18:57:00,395 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 [2022-07-12 18:57:00,396 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] [2022-07-12 18:57:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 18:57:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-07-12 18:57:00,412 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) [2022-07-12 18:57:00,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-12 18:57:00,416 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 14 [2022-07-12 18:57:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:00,417 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-12 18:57:00,417 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) [2022-07-12 18:57:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-12 18:57:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:57:00,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:00,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:00,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:00,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:00,631 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)] === [2022-07-12 18:57:00,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash -46717148, now seen corresponding path program 1 times [2022-07-12 18:57:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:00,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970838650] [2022-07-12 18:57:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:00,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:00,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:00,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:00,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 18:57:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:00,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:57:00,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:00,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:00,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970838650] [2022-07-12 18:57:00,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970838650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:00,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:00,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:57:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560379379] [2022-07-12 18:57:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:57:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:00,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:57:00,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:57:00,771 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) [2022-07-12 18:57:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:00,832 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-07-12 18:57:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:57:00,833 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 [2022-07-12 18:57:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:00,835 INFO L225 Difference]: With dead ends: 91 [2022-07-12 18:57:00,835 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:57:00,835 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 [2022-07-12 18:57:00,838 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 [2022-07-12 18:57:00,838 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] [2022-07-12 18:57:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:57:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2022-07-12 18:57:00,856 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) [2022-07-12 18:57:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-12 18:57:00,860 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2022-07-12 18:57:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:00,860 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-12 18:57:00,861 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) [2022-07-12 18:57:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-12 18:57:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:57:00,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:00,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:00,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:01,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:01,075 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)] === [2022-07-12 18:57:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash -945781721, now seen corresponding path program 1 times [2022-07-12 18:57:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:01,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029093769] [2022-07-12 18:57:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:01,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:01,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:01,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 18:57:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:01,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 18:57:01,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:01,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:01,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:01,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029093769] [2022-07-12 18:57:01,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029093769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:01,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:01,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:57:01,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642158067] [2022-07-12 18:57:01,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:01,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:57:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:01,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:57:01,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:57:01,163 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) [2022-07-12 18:57:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:01,183 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-12 18:57:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:57:01,184 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 [2022-07-12 18:57:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:01,185 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:57:01,185 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 18:57:01,185 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 [2022-07-12 18:57:01,186 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:01,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:57:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 18:57:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-12 18:57:01,190 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) [2022-07-12 18:57:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-07-12 18:57:01,191 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-07-12 18:57:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:01,191 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-07-12 18:57:01,191 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) [2022-07-12 18:57:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-07-12 18:57:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:57:01,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:01,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:01,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:01,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:01,401 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)] === [2022-07-12 18:57:01,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:01,402 INFO L85 PathProgramCache]: Analyzing trace with hash 686278594, now seen corresponding path program 1 times [2022-07-12 18:57:01,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:01,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979191560] [2022-07-12 18:57:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:01,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:01,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:01,404 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:01,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 18:57:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:01,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:57:01,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:01,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:01,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:01,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979191560] [2022-07-12 18:57:01,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979191560] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:57:01,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:01,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:57:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770404292] [2022-07-12 18:57:01,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:01,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:57:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:57:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:57:01,562 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) [2022-07-12 18:57:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:01,627 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-07-12 18:57:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:57:01,631 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 [2022-07-12 18:57:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:01,632 INFO L225 Difference]: With dead ends: 93 [2022-07-12 18:57:01,632 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 18:57:01,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:57:01,633 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:01,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 387 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:57:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 18:57:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-07-12 18:57:01,636 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) [2022-07-12 18:57:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-12 18:57:01,636 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 17 [2022-07-12 18:57:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:01,636 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-12 18:57:01,637 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) [2022-07-12 18:57:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-12 18:57:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:57:01,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:01,637 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:01,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:01,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:01,838 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)] === [2022-07-12 18:57:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1101750465, now seen corresponding path program 1 times [2022-07-12 18:57:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:01,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244084663] [2022-07-12 18:57:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:01,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:01,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:01,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 18:57:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:01,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:57:01,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:01,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:01,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:01,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244084663] [2022-07-12 18:57:01,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244084663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:01,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:01,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:57:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210513696] [2022-07-12 18:57:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:01,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:57:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:57:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:57:01,972 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) [2022-07-12 18:57:02,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:02,028 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-07-12 18:57:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:57:02,029 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 [2022-07-12 18:57:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:02,029 INFO L225 Difference]: With dead ends: 99 [2022-07-12 18:57:02,030 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:57:02,030 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 [2022-07-12 18:57:02,030 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 [2022-07-12 18:57:02,031 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] [2022-07-12 18:57:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:57:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2022-07-12 18:57:02,034 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) [2022-07-12 18:57:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-12 18:57:02,035 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 20 [2022-07-12 18:57:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:02,035 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-12 18:57:02,035 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) [2022-07-12 18:57:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-12 18:57:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:57:02,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:02,036 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:02,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 18:57:02,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:02,245 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)] === [2022-07-12 18:57:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473369, now seen corresponding path program 2 times [2022-07-12 18:57:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:02,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603190297] [2022-07-12 18:57:02,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:57:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:02,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:02,248 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:02,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 18:57:02,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:57:02,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:57:02,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:57:02,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:02,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 18:57:02,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:02,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603190297] [2022-07-12 18:57:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603190297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:02,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:02,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:57:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712822838] [2022-07-12 18:57:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:02,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:57:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:57:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:57:02,402 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) [2022-07-12 18:57:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:02,647 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-12 18:57:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:57:02,649 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 [2022-07-12 18:57:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:02,649 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:57:02,650 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:57:02,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:57:02,650 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2022-07-12 18:57:02,651 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] [2022-07-12 18:57:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:57:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2022-07-12 18:57:02,654 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) [2022-07-12 18:57:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-07-12 18:57:02,654 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 20 [2022-07-12 18:57:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:02,654 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-07-12 18:57:02,655 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) [2022-07-12 18:57:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-07-12 18:57:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:57:02,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:02,655 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:02,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:02,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:02,856 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)] === [2022-07-12 18:57:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473368, now seen corresponding path program 1 times [2022-07-12 18:57:02,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:02,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657122530] [2022-07-12 18:57:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:02,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:02,858 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:02,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 18:57:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:02,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:57:02,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:03,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:03,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:03,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657122530] [2022-07-12 18:57:03,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657122530] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:57:03,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:03,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-12 18:57:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947649428] [2022-07-12 18:57:03,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:03,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:57:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:57:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:57:03,207 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) [2022-07-12 18:57:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:03,419 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-12 18:57:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:03,419 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 [2022-07-12 18:57:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:03,420 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:57:03,420 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:57:03,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:57:03,421 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:03,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 563 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:57:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:57:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-07-12 18:57:03,425 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) [2022-07-12 18:57:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-07-12 18:57:03,425 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 20 [2022-07-12 18:57:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:03,426 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-07-12 18:57:03,426 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) [2022-07-12 18:57:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-07-12 18:57:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:57:03,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:03,427 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] [2022-07-12 18:57:03,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:03,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:03,636 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)] === [2022-07-12 18:57:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash -62141083, now seen corresponding path program 1 times [2022-07-12 18:57:03,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:03,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699342380] [2022-07-12 18:57:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:03,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:03,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:03,638 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:03,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 18:57:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:03,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:57:03,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 18:57:03,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:03,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:03,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699342380] [2022-07-12 18:57:03,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699342380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:03,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:03,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:57:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888409469] [2022-07-12 18:57:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:57:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:57:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:57:03,732 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) [2022-07-12 18:57:03,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:03,817 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-07-12 18:57:03,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:57:03,818 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 [2022-07-12 18:57:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:03,819 INFO L225 Difference]: With dead ends: 105 [2022-07-12 18:57:03,819 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 18:57:03,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:57:03,820 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:03,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 151 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:57:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 18:57:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-07-12 18:57:03,822 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) [2022-07-12 18:57:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-12 18:57:03,823 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 23 [2022-07-12 18:57:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:03,823 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-12 18:57:03,823 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) [2022-07-12 18:57:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-12 18:57:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:57:03,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:03,824 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:57:03,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-12 18:57:04,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:04,033 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)] === [2022-07-12 18:57:04,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2043849464, now seen corresponding path program 2 times [2022-07-12 18:57:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:04,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867665568] [2022-07-12 18:57:04,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:57:04,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:04,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:04,035 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:04,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 18:57:04,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:57:04,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:57:04,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:57:04,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:04,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 18:57:04,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:04,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:04,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867665568] [2022-07-12 18:57:04,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867665568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:04,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:04,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:57:04,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55413859] [2022-07-12 18:57:04,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:04,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:57:04,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:57:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:57:04,260 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) [2022-07-12 18:57:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:04,589 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-07-12 18:57:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:57:04,590 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 [2022-07-12 18:57:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:04,590 INFO L225 Difference]: With dead ends: 99 [2022-07-12 18:57:04,591 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:57:04,591 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 [2022-07-12 18:57:04,591 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 [2022-07-12 18:57:04,591 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] [2022-07-12 18:57:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:57:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-07-12 18:57:04,594 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) [2022-07-12 18:57:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-12 18:57:04,594 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 26 [2022-07-12 18:57:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:04,594 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-12 18:57:04,595 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) [2022-07-12 18:57:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-12 18:57:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:57:04,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:04,595 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] [2022-07-12 18:57:04,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:04,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:04,804 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)] === [2022-07-12 18:57:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1441027708, now seen corresponding path program 1 times [2022-07-12 18:57:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575681445] [2022-07-12 18:57:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:04,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:04,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:04,806 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:04,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 18:57:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:04,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:57:04,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:05,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:05,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:05,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575681445] [2022-07-12 18:57:05,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575681445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:57:05,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:05,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-12 18:57:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657258080] [2022-07-12 18:57:05,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:05,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 18:57:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:05,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 18:57:05,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:57:05,560 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) [2022-07-12 18:57:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:05,939 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-07-12 18:57:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:57:05,940 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 [2022-07-12 18:57:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:05,941 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:57:05,941 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 18:57:05,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:57:05,942 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 32 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:05,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 984 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:57:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 18:57:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-12 18:57:05,944 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) [2022-07-12 18:57:05,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-07-12 18:57:05,945 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 30 [2022-07-12 18:57:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:05,945 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-07-12 18:57:05,945 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) [2022-07-12 18:57:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-07-12 18:57:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:57:05,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:05,946 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] [2022-07-12 18:57:05,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:06,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:06,151 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)] === [2022-07-12 18:57:06,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:06,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107868, now seen corresponding path program 2 times [2022-07-12 18:57:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:06,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189864436] [2022-07-12 18:57:06,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:57:06,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:06,154 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:06,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 18:57:06,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:57:06,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:57:06,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 18:57:06,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:06,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:06,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:06,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:06,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189864436] [2022-07-12 18:57:06,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189864436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:06,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:06,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:57:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765865407] [2022-07-12 18:57:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:06,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:57:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:06,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:57:06,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:57:06,499 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) [2022-07-12 18:57:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:06,827 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-12 18:57:06,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:57:06,827 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 [2022-07-12 18:57:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:06,828 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:57:06,828 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 18:57:06,828 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 [2022-07-12 18:57:06,829 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:06,829 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.3s Time] [2022-07-12 18:57:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 18:57:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2022-07-12 18:57:06,831 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) [2022-07-12 18:57:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-12 18:57:06,832 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 36 [2022-07-12 18:57:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:06,832 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-12 18:57:06,832 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) [2022-07-12 18:57:06,833 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-12 18:57:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:57:06,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:06,833 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] [2022-07-12 18:57:06,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:07,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:07,034 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)] === [2022-07-12 18:57:07,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107867, now seen corresponding path program 1 times [2022-07-12 18:57:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:07,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756013557] [2022-07-12 18:57:07,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:07,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:07,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:07,036 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:07,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 18:57:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:07,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:57:07,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:07,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:07,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:07,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:07,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756013557] [2022-07-12 18:57:07,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756013557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:07,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:07,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:57:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596995036] [2022-07-12 18:57:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:07,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:57:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:07,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:57:07,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:57:07,324 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) [2022-07-12 18:57:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:07,563 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-07-12 18:57:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:57:07,563 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 [2022-07-12 18:57:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:07,564 INFO L225 Difference]: With dead ends: 87 [2022-07-12 18:57:07,564 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 18:57:07,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:57:07,565 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2022-07-12 18:57:07,565 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] [2022-07-12 18:57:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 18:57:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-07-12 18:57:07,567 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) [2022-07-12 18:57:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-12 18:57:07,568 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 36 [2022-07-12 18:57:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:07,568 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-12 18:57:07,568 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) [2022-07-12 18:57:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-12 18:57:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:57:07,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:07,569 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] [2022-07-12 18:57:07,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:07,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:07,778 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)] === [2022-07-12 18:57:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 94582189, now seen corresponding path program 1 times [2022-07-12 18:57:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:07,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023713917] [2022-07-12 18:57:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:07,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:07,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:07,792 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:07,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 18:57:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:07,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:57:07,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:08,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:08,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:08,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023713917] [2022-07-12 18:57:08,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023713917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:08,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:08,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:57:08,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694663678] [2022-07-12 18:57:08,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:08,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:57:08,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:08,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:57:08,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:57:08,004 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) [2022-07-12 18:57:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:08,033 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-07-12 18:57:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:57:08,034 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 [2022-07-12 18:57:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:08,035 INFO L225 Difference]: With dead ends: 84 [2022-07-12 18:57:08,035 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 18:57:08,035 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 [2022-07-12 18:57:08,035 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 [2022-07-12 18:57:08,036 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] [2022-07-12 18:57:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 18:57:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-12 18:57:08,038 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) [2022-07-12 18:57:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-12 18:57:08,038 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 36 [2022-07-12 18:57:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:08,039 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-12 18:57:08,039 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) [2022-07-12 18:57:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-12 18:57:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:57:08,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:08,040 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] [2022-07-12 18:57:08,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:08,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:08,251 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)] === [2022-07-12 18:57:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2072333273, now seen corresponding path program 1 times [2022-07-12 18:57:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:08,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455230482] [2022-07-12 18:57:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:08,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:08,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 18:57:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:08,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:57:08,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:08,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:08,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:08,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455230482] [2022-07-12 18:57:08,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455230482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:08,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:08,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:57:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505467688] [2022-07-12 18:57:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:08,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:57:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:57:08,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:57:08,466 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) [2022-07-12 18:57:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:08,517 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-07-12 18:57:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:57:08,518 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 [2022-07-12 18:57:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:08,518 INFO L225 Difference]: With dead ends: 84 [2022-07-12 18:57:08,518 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 18:57:08,519 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 [2022-07-12 18:57:08,519 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 [2022-07-12 18:57:08,519 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] [2022-07-12 18:57:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 18:57:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-12 18:57:08,521 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) [2022-07-12 18:57:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-12 18:57:08,522 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 38 [2022-07-12 18:57:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:08,522 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-12 18:57:08,522 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) [2022-07-12 18:57:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-12 18:57:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:57:08,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:08,523 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] [2022-07-12 18:57:08,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:08,734 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)] === [2022-07-12 18:57:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293974, now seen corresponding path program 1 times [2022-07-12 18:57:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184191415] [2022-07-12 18:57:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:08,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:08,736 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:08,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 18:57:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:08,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:57:08,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:08,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:09,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:09,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:09,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184191415] [2022-07-12 18:57:09,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184191415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:09,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:09,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:57:09,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697392044] [2022-07-12 18:57:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:09,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:57:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:09,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:57:09,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:57:09,047 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) [2022-07-12 18:57:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:09,363 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-07-12 18:57:09,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:09,364 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 [2022-07-12 18:57:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:09,365 INFO L225 Difference]: With dead ends: 115 [2022-07-12 18:57:09,365 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 18:57:09,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:57:09,365 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:09,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 358 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 18 Unchecked, 0.3s Time] [2022-07-12 18:57:09,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 18:57:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2022-07-12 18:57:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 90 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 18:57:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-12 18:57:09,369 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 46 [2022-07-12 18:57:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:09,369 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-12 18:57:09,370 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) [2022-07-12 18:57:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-12 18:57:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:57:09,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:09,370 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] [2022-07-12 18:57:09,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:09,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:09,576 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)] === [2022-07-12 18:57:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293975, now seen corresponding path program 1 times [2022-07-12 18:57:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:09,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231451747] [2022-07-12 18:57:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:09,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:09,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:09,578 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:09,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-12 18:57:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:09,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:57:09,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:09,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:10,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:10,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:10,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231451747] [2022-07-12 18:57:10,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231451747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:10,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:10,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:57:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283671238] [2022-07-12 18:57:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:10,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:57:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:10,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:57:10,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:57:10,040 INFO L87 Difference]: Start difference. First operand 99 states and 107 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) [2022-07-12 18:57:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:10,380 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2022-07-12 18:57:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:57:10,381 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 [2022-07-12 18:57:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:10,382 INFO L225 Difference]: With dead ends: 125 [2022-07-12 18:57:10,382 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 18:57:10,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:57:10,383 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 127 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:10,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 401 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2022-07-12 18:57:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 18:57:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-12 18:57:10,385 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) [2022-07-12 18:57:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-07-12 18:57:10,386 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 46 [2022-07-12 18:57:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:10,386 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-07-12 18:57:10,386 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) [2022-07-12 18:57:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-07-12 18:57:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:57:10,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:10,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] [2022-07-12 18:57:10,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:10,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:10,599 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)] === [2022-07-12 18:57:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:10,600 INFO L85 PathProgramCache]: Analyzing trace with hash -882834383, now seen corresponding path program 1 times [2022-07-12 18:57:10,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:10,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389263669] [2022-07-12 18:57:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:10,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:10,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:10,601 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:10,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 18:57:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:10,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:57:10,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:10,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:10,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:10,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389263669] [2022-07-12 18:57:10,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389263669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:10,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:10,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:57:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573312185] [2022-07-12 18:57:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:10,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:57:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:57:10,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:57:10,875 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) [2022-07-12 18:57:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:10,961 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-07-12 18:57:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:57:10,961 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 [2022-07-12 18:57:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:10,963 INFO L225 Difference]: With dead ends: 111 [2022-07-12 18:57:10,963 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 18:57:10,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:57:10,963 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:10,964 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.1s Time] [2022-07-12 18:57:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 18:57:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-07-12 18:57:10,966 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) [2022-07-12 18:57:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2022-07-12 18:57:10,966 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 52 [2022-07-12 18:57:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:10,966 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2022-07-12 18:57:10,967 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) [2022-07-12 18:57:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2022-07-12 18:57:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:57:10,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:10,967 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] [2022-07-12 18:57:10,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:11,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:11,178 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)] === [2022-07-12 18:57:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash -644390150, now seen corresponding path program 1 times [2022-07-12 18:57:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:11,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021632620] [2022-07-12 18:57:11,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:11,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:11,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:11,180 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:11,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-12 18:57:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:11,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:57:11,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:11,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:11,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:11,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:11,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021632620] [2022-07-12 18:57:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021632620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:11,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:57:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603671385] [2022-07-12 18:57:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:57:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:57:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:57:11,586 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) [2022-07-12 18:57:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:11,928 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2022-07-12 18:57:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:11,929 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 [2022-07-12 18:57:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:11,929 INFO L225 Difference]: With dead ends: 113 [2022-07-12 18:57:11,930 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 18:57:11,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:57:11,930 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:11,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 387 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 19 Unchecked, 0.3s Time] [2022-07-12 18:57:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 18:57:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-07-12 18:57:11,933 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) [2022-07-12 18:57:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-07-12 18:57:11,934 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 52 [2022-07-12 18:57:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:11,934 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-07-12 18:57:11,934 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) [2022-07-12 18:57:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-07-12 18:57:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:57:11,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:11,935 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] [2022-07-12 18:57:11,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:12,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:12,143 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)] === [2022-07-12 18:57:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash -644390149, now seen corresponding path program 1 times [2022-07-12 18:57:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:12,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888390231] [2022-07-12 18:57:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:12,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:12,146 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:12,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 18:57:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:12,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 18:57:12,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:12,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:12,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:12,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:12,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888390231] [2022-07-12 18:57:12,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888390231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:12,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:12,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:57:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187414672] [2022-07-12 18:57:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:12,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:57:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:12,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:57:12,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:57:12,698 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) [2022-07-12 18:57:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:13,120 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-07-12 18:57:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:13,122 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 [2022-07-12 18:57:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:13,122 INFO L225 Difference]: With dead ends: 114 [2022-07-12 18:57:13,123 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 18:57:13,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:57:13,123 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 126 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:13,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 441 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 15 Unchecked, 0.3s Time] [2022-07-12 18:57:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 18:57:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-07-12 18:57:13,126 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) [2022-07-12 18:57:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2022-07-12 18:57:13,127 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 52 [2022-07-12 18:57:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:13,127 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2022-07-12 18:57:13,127 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) [2022-07-12 18:57:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-07-12 18:57:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:57:13,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:13,128 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] [2022-07-12 18:57:13,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-12 18:57:13,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:13,342 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)] === [2022-07-12 18:57:13,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1476913121, now seen corresponding path program 1 times [2022-07-12 18:57:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:13,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933543498] [2022-07-12 18:57:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:13,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:13,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:13,344 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:13,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 18:57:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:13,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:57:13,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:13,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:13,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:13,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933543498] [2022-07-12 18:57:13,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933543498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:13,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:13,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:57:13,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723891849] [2022-07-12 18:57:13,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:13,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:57:13,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:57:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:57:13,937 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) [2022-07-12 18:57:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:14,288 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2022-07-12 18:57:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:14,288 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 [2022-07-12 18:57:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:14,289 INFO L225 Difference]: With dead ends: 113 [2022-07-12 18:57:14,289 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 18:57:14,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:57:14,290 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 170 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:14,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 502 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 211 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2022-07-12 18:57:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 18:57:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-07-12 18:57:14,293 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) [2022-07-12 18:57:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-07-12 18:57:14,294 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 55 [2022-07-12 18:57:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:14,294 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-07-12 18:57:14,294 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) [2022-07-12 18:57:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-07-12 18:57:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:57:14,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:14,295 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] [2022-07-12 18:57:14,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:14,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:14,508 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)] === [2022-07-12 18:57:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1073931710, now seen corresponding path program 1 times [2022-07-12 18:57:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:14,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202803993] [2022-07-12 18:57:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:14,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:14,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:14,510 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:14,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 18:57:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:14,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-12 18:57:14,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:14,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:57:14,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:14,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:14,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:14,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:15,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:15,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:15,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:15,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:57:20,963 WARN L855 $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 [2022-07-12 18:57:20,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:20,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:20,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:20,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-07-12 18:57:21,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:21,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 45 [2022-07-12 18:57:21,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:57:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:21,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:22,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:22,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202803993] [2022-07-12 18:57:22,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202803993] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:22,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [67696918] [2022-07-12 18:57:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:57:22,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:57:22,251 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) [2022-07-12 18:57:22,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-12 18:57:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:22,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 18:57:22,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:22,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:57:22,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:22,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:22,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:22,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:22,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:22,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:22,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:22,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:23,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:23,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:23,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:23,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:23,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:23,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:23,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:23,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:23,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:57:26,378 WARN L855 $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 [2022-07-12 18:57:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:26,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-07-12 18:57:26,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 39 [2022-07-12 18:57:26,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:26,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 18:57:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:26,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:28,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [67696918] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:28,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:28,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 44 [2022-07-12 18:57:28,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500709536] [2022-07-12 18:57:28,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:28,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 18:57:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 18:57:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3198, Unknown=3, NotChecked=230, Total=3660 [2022-07-12 18:57:28,213 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) [2022-07-12 18:57:32,640 WARN L855 $PredicateComparison]: unable to prove that (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 (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)))) (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 [2022-07-12 18:57:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:33,507 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-07-12 18:57:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 18:57:33,508 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 [2022-07-12 18:57:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:33,509 INFO L225 Difference]: With dead ends: 121 [2022-07-12 18:57:33,509 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 18:57:33,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=560, Invalid=7458, Unknown=4, NotChecked=534, Total=8556 [2022-07-12 18:57:33,511 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 204 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:33,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 825 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1260 Invalid, 0 Unknown, 310 Unchecked, 1.8s Time] [2022-07-12 18:57:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 18:57:33,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2022-07-12 18:57:33,513 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) [2022-07-12 18:57:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-12 18:57:33,514 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 58 [2022-07-12 18:57:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:33,514 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-12 18:57:33,515 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) [2022-07-12 18:57:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-12 18:57:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 18:57:33,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:33,515 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] [2022-07-12 18:57:33,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:33,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-07-12 18:57:33,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 18:57:33,920 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)] === [2022-07-12 18:57:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896519, now seen corresponding path program 1 times [2022-07-12 18:57:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:33,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676371609] [2022-07-12 18:57:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:33,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:33,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:33,922 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:33,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 18:57:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:34,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:57:34,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:34,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:34,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:34,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:34,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676371609] [2022-07-12 18:57:34,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676371609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:57:34,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:34,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-12 18:57:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696948909] [2022-07-12 18:57:34,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:34,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:57:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:57:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:57:34,501 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) [2022-07-12 18:57:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:34,868 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-07-12 18:57:34,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:57:34,868 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 [2022-07-12 18:57:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:34,869 INFO L225 Difference]: With dead ends: 146 [2022-07-12 18:57:34,869 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 18:57:34,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:57:34,870 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 114 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:34,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 447 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 46 Unchecked, 0.3s Time] [2022-07-12 18:57:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 18:57:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2022-07-12 18:57:34,873 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) [2022-07-12 18:57:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-07-12 18:57:34,874 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 60 [2022-07-12 18:57:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:34,874 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-07-12 18:57:34,875 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) [2022-07-12 18:57:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-07-12 18:57:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 18:57:34,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:34,876 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] [2022-07-12 18:57:34,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-12 18:57:35,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:35,083 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)] === [2022-07-12 18:57:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896518, now seen corresponding path program 1 times [2022-07-12 18:57:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:35,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924626769] [2022-07-12 18:57:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:35,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:35,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:35,085 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:35,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-12 18:57:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:35,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:57:35,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:35,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:35,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:35,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:35,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924626769] [2022-07-12 18:57:35,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924626769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:35,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:35,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:57:35,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975476992] [2022-07-12 18:57:35,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:35,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:57:35,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:35,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:57:35,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:57:35,716 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) [2022-07-12 18:57:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:35,961 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-12 18:57:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:57:35,962 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 [2022-07-12 18:57:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:35,962 INFO L225 Difference]: With dead ends: 135 [2022-07-12 18:57:35,962 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 18:57:35,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:57:35,963 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:35,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 412 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-07-12 18:57:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 18:57:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2022-07-12 18:57:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2) internal successors, (126), 117 states have internal predecessors, (126), 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) [2022-07-12 18:57:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-07-12 18:57:35,967 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 60 [2022-07-12 18:57:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:35,968 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-07-12 18:57:35,968 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) [2022-07-12 18:57:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-07-12 18:57:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 18:57:35,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:35,968 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] [2022-07-12 18:57:35,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:36,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:36,178 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)] === [2022-07-12 18:57:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1067855226, now seen corresponding path program 1 times [2022-07-12 18:57:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549484111] [2022-07-12 18:57:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:36,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:36,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:36,182 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:36,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 18:57:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:36,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-12 18:57:36,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:36,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:57:36,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:36,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:36,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:36,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:36,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:36,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:36,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:36,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:36,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:36,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:36,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:36,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:36,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:36,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:37,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:37,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:37,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:37,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:37,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:37,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:37,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:37,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:37,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:37,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:57:42,683 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ BitVec 32))) (= (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)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-12 18:57:42,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-07-12 18:57:42,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:42,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 45 [2022-07-12 18:57:43,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 18:57:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:43,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:43,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549484111] [2022-07-12 18:57:43,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549484111] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1154973417] [2022-07-12 18:57:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:43,994 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 18:57:43,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 18:57:43,995 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) [2022-07-12 18:57:43,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-12 18:57:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:44,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 18:57:44,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:44,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:57:44,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:44,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:44,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:57:44,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:44,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:44,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:45,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:45,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:57:45,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:45,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-12 18:57:48,436 WARN L855 $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 [2022-07-12 18:57:48,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:48,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:48,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:57:48,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-07-12 18:57:48,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 39 [2022-07-12 18:57:48,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:57:48,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 18:57:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:57:48,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:50,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1154973417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:57:50,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:50,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 46 [2022-07-12 18:57:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21580104] [2022-07-12 18:57:50,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:50,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 18:57:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 18:57:50,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3299, Unknown=3, NotChecked=234, Total=3782 [2022-07-12 18:57:50,395 INFO L87 Difference]: Start difference. First operand 128 states and 139 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) [2022-07-12 18:57:54,221 WARN L855 $PredicateComparison]: unable to prove that (and (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)))) (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ BitVec 32))) (= (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)) |c_#memory_$Pointer$.base|))) is different from true [2022-07-12 18:57:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:55,292 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-07-12 18:57:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 18:57:55,293 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 [2022-07-12 18:57:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:55,294 INFO L225 Difference]: With dead ends: 140 [2022-07-12 18:57:55,294 INFO L226 Difference]: Without dead ends: 139 [2022-07-12 18:57:55,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=481, Invalid=5379, Unknown=4, NotChecked=456, Total=6320 [2022-07-12 18:57:55,296 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 174 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:55,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 911 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1327 Invalid, 0 Unknown, 251 Unchecked, 2.1s Time] [2022-07-12 18:57:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-12 18:57:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2022-07-12 18:57:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 114 states have internal predecessors, (120), 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) [2022-07-12 18:57:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-07-12 18:57:55,300 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 59 [2022-07-12 18:57:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:55,301 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-07-12 18:57:55,301 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) [2022-07-12 18:57:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-07-12 18:57:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 18:57:55,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:55,302 INFO L195 NwaCegarLoop]: trace histogram [16, 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] [2022-07-12 18:57:55,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2022-07-12 18:57:55,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:55,709 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1066761989, now seen corresponding path program 1 times [2022-07-12 18:57:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:55,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632708613] [2022-07-12 18:57:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:55,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:55,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:55,710 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:55,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 18:57:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:56,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 18:57:56,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:56,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:56,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:56,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:56,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632708613] [2022-07-12 18:57:56,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632708613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:56,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:56,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:57:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372308901] [2022-07-12 18:57:56,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:56,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:57:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:56,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:57:56,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:57:56,370 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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) [2022-07-12 18:57:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:56,599 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-07-12 18:57:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:57:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 62 [2022-07-12 18:57:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:56,600 INFO L225 Difference]: With dead ends: 129 [2022-07-12 18:57:56,600 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 18:57:56,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:57:56,601 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:56,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 334 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-07-12 18:57:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 18:57:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-07-12 18:57:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 114 states have internal predecessors, (119), 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) [2022-07-12 18:57:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2022-07-12 18:57:56,605 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 62 [2022-07-12 18:57:56,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:56,605 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2022-07-12 18:57:56,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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) [2022-07-12 18:57:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2022-07-12 18:57:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 18:57:56,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:56,606 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] [2022-07-12 18:57:56,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:56,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:56,819 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1335956715, now seen corresponding path program 1 times [2022-07-12 18:57:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:56,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598726554] [2022-07-12 18:57:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:56,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:56,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:56,821 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:56,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 18:57:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:57,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:57:57,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-12 18:57:57,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:57,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:57,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598726554] [2022-07-12 18:57:57,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598726554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:57,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:57,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:57:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275101829] [2022-07-12 18:57:57,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:57,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:57:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:57,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:57:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:57:57,211 INFO L87 Difference]: Start difference. First operand 125 states and 132 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) [2022-07-12 18:57:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:57,311 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-07-12 18:57:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:57:57,312 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 [2022-07-12 18:57:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:57,312 INFO L225 Difference]: With dead ends: 129 [2022-07-12 18:57:57,312 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 18:57:57,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:57:57,313 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 423 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 [2022-07-12 18:57:57,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 423 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:57:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 18:57:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 18:57:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 114 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) [2022-07-12 18:57:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-12 18:57:57,316 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 63 [2022-07-12 18:57:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:57,317 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-12 18:57:57,317 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) [2022-07-12 18:57:57,317 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-12 18:57:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 18:57:57,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:57,318 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] [2022-07-12 18:57:57,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-12 18:57:57,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:57,534 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836323, now seen corresponding path program 1 times [2022-07-12 18:57:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:57,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731144479] [2022-07-12 18:57:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:57,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:57,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:57,536 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:57,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 18:57:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:57,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:57:57,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:57,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:58,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:57:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:58,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:58,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731144479] [2022-07-12 18:57:58,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731144479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:57:58,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:57:58,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-12 18:57:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474283388] [2022-07-12 18:57:58,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:57:58,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:57:58,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:57:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:57:58,191 INFO L87 Difference]: Start difference. First operand 125 states and 130 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) [2022-07-12 18:57:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:58,458 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-12 18:57:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:57:58,459 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 [2022-07-12 18:57:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:58,460 INFO L225 Difference]: With dead ends: 127 [2022-07-12 18:57:58,460 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 18:57:58,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:57:58,461 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:58,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2022-07-12 18:57:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 18:57:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2022-07-12 18:57:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.1553398058252426) internal successors, (119), 115 states have internal predecessors, (119), 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) [2022-07-12 18:57:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2022-07-12 18:57:58,464 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 66 [2022-07-12 18:57:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:58,465 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2022-07-12 18:57:58,465 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) [2022-07-12 18:57:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2022-07-12 18:57:58,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 18:57:58,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:58,466 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] [2022-07-12 18:57:58,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-12 18:57:58,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:58,678 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836322, now seen corresponding path program 1 times [2022-07-12 18:57:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:58,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525599484] [2022-07-12 18:57:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:58,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:58,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:58,680 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:58,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-12 18:57:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:57:59,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 18:57:59,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:57:59,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 18:57:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:57:59,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:57:59,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:57:59,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525599484] [2022-07-12 18:57:59,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525599484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:57:59,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:57:59,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 18:57:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510753405] [2022-07-12 18:57:59,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:57:59,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:57:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:57:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:57:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:57:59,387 INFO L87 Difference]: Start difference. First operand 126 states and 132 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) [2022-07-12 18:57:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:57:59,672 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-07-12 18:57:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:57:59,673 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 [2022-07-12 18:57:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:57:59,673 INFO L225 Difference]: With dead ends: 129 [2022-07-12 18:57:59,673 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 18:57:59,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:57:59,674 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:57:59,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 439 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-07-12 18:57:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 18:57:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-07-12 18:57:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.145631067961165) internal successors, (118), 115 states have internal predecessors, (118), 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) [2022-07-12 18:57:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-07-12 18:57:59,678 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 66 [2022-07-12 18:57:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:57:59,678 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-07-12 18:57:59,678 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) [2022-07-12 18:57:59,678 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-07-12 18:57:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 18:57:59,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:57:59,679 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] [2022-07-12 18:57:59,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-12 18:57:59,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:57:59,893 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:57:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:57:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1739148477, now seen corresponding path program 1 times [2022-07-12 18:57:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:57:59,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092879288] [2022-07-12 18:57:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:57:59,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:57:59,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:57:59,895 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:57:59,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-12 18:58:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:00,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:58:00,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:58:00,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:58:00,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:58:00,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092879288] [2022-07-12 18:58:00,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092879288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:00,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:00,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:58:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061429202] [2022-07-12 18:58:00,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:00,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:58:00,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:58:00,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:58:00,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:58:00,368 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:58:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:00,521 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-07-12 18:58:00,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:58:00,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 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 68 [2022-07-12 18:58:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:00,522 INFO L225 Difference]: With dead ends: 125 [2022-07-12 18:58:00,522 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 18:58:00,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:58:00,524 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:00,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 668 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:58:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 18:58:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 18:58:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 114 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) [2022-07-12 18:58:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-12 18:58:00,527 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 68 [2022-07-12 18:58:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:00,527 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-12 18:58:00,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 18:58:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-12 18:58:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 18:58:00,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:00,528 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] [2022-07-12 18:58:00,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-12 18:58:00,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:58:00,729 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:58:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1920971938, now seen corresponding path program 1 times [2022-07-12 18:58:00,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:58:00,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449795093] [2022-07-12 18:58:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:58:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:58:00,731 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:58:00,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-12 18:58:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:58:01,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:58:01,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:58:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 18:58:01,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:58:01,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:58:01,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449795093] [2022-07-12 18:58:01,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449795093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:58:01,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:58:01,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 18:58:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156462266] [2022-07-12 18:58:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:58:01,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:58:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:58:01,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:58:01,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:58:01,619 INFO L87 Difference]: Start difference. First operand 125 states and 130 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) [2022-07-12 18:58:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:58:01,871 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-07-12 18:58:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:58:01,871 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 [2022-07-12 18:58:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:58:01,872 INFO L225 Difference]: With dead ends: 138 [2022-07-12 18:58:01,872 INFO L226 Difference]: Without dead ends: 138 [2022-07-12 18:58:01,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:58:01,873 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 91 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:58:01,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 455 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-07-12 18:58:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-12 18:58:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2022-07-12 18:58:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 117 states have internal predecessors, (120), 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) [2022-07-12 18:58:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-07-12 18:58:01,877 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 69 [2022-07-12 18:58:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:58:01,878 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-07-12 18:58:01,878 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) [2022-07-12 18:58:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-07-12 18:58:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 18:58:01,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:58:01,879 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] [2022-07-12 18:58:01,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:02,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:58:02,093 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-12 18:58:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:58:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295794, now seen corresponding path program 1 times [2022-07-12 18:58:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:58:02,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243119722] [2022-07-12 18:58:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:58:02,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:58:02,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:58:02,095 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:58:02,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-12 18:58:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:58:02,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 18:58:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 18:58:02,854 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 18:58:02,854 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 18:58:02,855 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-07-12 18:58:02,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-07-12 18:58:02,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-07-12 18:58:02,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-07-12 18:58:02,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-07-12 18:58:02,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (15 of 21 remaining) [2022-07-12 18:58:02,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-07-12 18:58:02,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-07-12 18:58:02,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-07-12 18:58:02,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-07-12 18:58:02,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-07-12 18:58:02,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-07-12 18:58:02,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-07-12 18:58:02,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-07-12 18:58:02,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-07-12 18:58:02,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-07-12 18:58:02,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-07-12 18:58:02,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-07-12 18:58:02,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-07-12 18:58:02,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-07-12 18:58:02,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 21 remaining) [2022-07-12 18:58:02,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-12 18:58:03,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:58:03,081 INFO L356 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, 1, 1] [2022-07-12 18:58:03,084 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 18:58:03,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,097 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,100 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,104 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,106 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,107 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,108 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,111 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,112 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,113 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,114 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,115 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,116 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,118 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,119 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,120 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,121 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,123 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,125 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,126 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:58:03 BoogieIcfgContainer [2022-07-12 18:58:03,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 18:58:03,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 18:58:03,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 18:58:03,170 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 18:58:03,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:56:58" (3/4) ... [2022-07-12 18:58:03,172 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 18:58:03,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,182 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,183 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,184 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,184 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,185 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,186 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,187 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,188 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,189 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,191 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-12 18:58:03,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,192 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-12 18:58:03,241 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 18:58:03,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 18:58:03,242 INFO L158 Benchmark]: Toolchain (without parser) took 66242.94ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 35.5MB in the beginning and 28.2MB in the end (delta: 7.3MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-07-12 18:58:03,242 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:58:03,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.36ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.2MB in the beginning and 50.9MB in the end (delta: -15.7MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-07-12 18:58:03,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.32ms. Allocated memory is still 71.3MB. Free memory was 50.9MB in the beginning and 48.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 18:58:03,243 INFO L158 Benchmark]: Boogie Preprocessor took 55.84ms. Allocated memory is still 71.3MB. Free memory was 48.3MB in the beginning and 46.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 18:58:03,243 INFO L158 Benchmark]: RCFGBuilder took 578.08ms. Allocated memory is still 71.3MB. Free memory was 46.2MB in the beginning and 46.1MB in the end (delta: 81.0kB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2022-07-12 18:58:03,244 INFO L158 Benchmark]: TraceAbstraction took 64857.56ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 45.7MB in the beginning and 38.1MB in the end (delta: 7.6MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-07-12 18:58:03,244 INFO L158 Benchmark]: Witness Printer took 72.51ms. Allocated memory is still 86.0MB. Free memory was 38.1MB in the beginning and 28.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 18:58:03,245 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.19ms. Allocated memory is still 58.7MB. Free memory was 40.6MB in the beginning and 40.6MB in the end (delta: 50.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.36ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 35.2MB in the beginning and 50.9MB in the end (delta: -15.7MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.32ms. Allocated memory is still 71.3MB. Free memory was 50.9MB in the beginning and 48.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.84ms. Allocated memory is still 71.3MB. Free memory was 48.3MB in the beginning and 46.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.08ms. Allocated memory is still 71.3MB. Free memory was 46.2MB in the beginning and 46.1MB in the end (delta: 81.0kB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 64857.56ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 45.7MB in the beginning and 38.1MB in the end (delta: 7.6MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Witness Printer took 72.51ms. Allocated memory is still 86.0MB. Free memory was 38.1MB in the beginning and 28.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. 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_#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 * 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: 64.7s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2061 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2035 mSDsluCounter, 14293 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 822 IncrementalHoareTripleChecker+Unchecked, 12056 mSDsCounter, 367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6543 IncrementalHoareTripleChecker+Invalid, 7732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 367 mSolverCounterUnsat, 2237 mSDtfsCounter, 6543 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1261 SyntacticMatches, 42 SemanticMatches, 522 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3972 ImplicationChecksByTransitivity, 33.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=25, InterpolantAutomatonStates: 402, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 241 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1581 ConstructedInterpolants, 139 QuantifiedInterpolants, 9899 SizeOfPredicates, 540 NumberOfNonLiveVariables, 9457 ConjunctsInSsa, 1030 ConjunctsInUnsatCore, 40 InterpolantComputations, 26 PerfectInterpolantSequences, 2829/3527 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 18:58:03,281 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)