./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 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_4.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 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:11:32,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:11:32,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:11:32,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:11:32,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:11:32,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:11:32,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:11:32,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:11:32,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:11:32,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:11:32,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:11:32,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:11:32,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:11:32,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:11:32,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:11:32,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:11:32,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:11:32,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:11:32,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:11:32,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:11:32,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:11:32,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:11:32,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:11:32,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:11:32,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:11:32,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:11:32,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:11:32,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:11:32,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:11:32,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:11:32,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:11:32,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:11:32,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:11:32,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:11:32,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:11:32,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:11:32,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:11:32,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:11:32,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:11:32,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:11:32,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:11:32,590 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:11:32,615 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:11:32,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:11:32,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:11:32,616 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:11:32,617 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:11:32,617 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:11:32,618 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:11:32,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:11:32,618 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:11:32,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:11:32,619 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:11:32,619 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:11:32,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:11:32,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:11:32,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:11:32,620 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:11:32,620 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:11:32,621 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:11:32,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:11:32,621 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:11:32,621 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:11:32,621 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:11:32,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:11:32,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:11:32,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:11:32,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:11:32,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:11:32,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:11:32,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:11:32,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:11:32,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:11:32,623 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 -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2021-12-21 18:11:32,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:11:32,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:11:32,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:11:32,887 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:11:32,888 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:11:32,890 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2021-12-21 18:11:32,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340c76faa/7995bb7ff7c24312a3c243c2eb3231fb/FLAG99a955608 [2021-12-21 18:11:33,421 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:11:33,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2021-12-21 18:11:33,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340c76faa/7995bb7ff7c24312a3c243c2eb3231fb/FLAG99a955608 [2021-12-21 18:11:33,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340c76faa/7995bb7ff7c24312a3c243c2eb3231fb [2021-12-21 18:11:33,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:11:33,770 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:11:33,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:33,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:11:33,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:11:33,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:33" (1/1) ... [2021-12-21 18:11:33,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7379e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:33, skipping insertion in model container [2021-12-21 18:11:33,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:33" (1/1) ... [2021-12-21 18:11:33,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:11:33,844 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:11:34,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:34,141 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-21 18:11:34,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c8ff0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:34, skipping insertion in model container [2021-12-21 18:11:34,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:34,142 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-21 18:11:34,145 INFO L158 Benchmark]: Toolchain (without parser) took 373.20ms. Allocated memory is still 113.2MB. Free memory was 73.9MB in the beginning and 84.6MB in the end (delta: -10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 18:11:34,145 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:11:34,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.93ms. Allocated memory is still 113.2MB. Free memory was 73.7MB in the beginning and 84.6MB in the end (delta: -10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 18:11:34,148 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 113.2MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.93ms. Allocated memory is still 113.2MB. Free memory was 73.7MB in the beginning and 84.6MB in the end (delta: -10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_4.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 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:11:35,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:11:35,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:11:35,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:11:35,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:11:35,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:11:35,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:11:35,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:11:35,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:11:35,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:11:35,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:11:35,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:11:35,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:11:35,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:11:35,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:11:35,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:11:35,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:11:35,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:11:35,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:11:35,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:11:35,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:11:35,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:11:35,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:11:35,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:11:35,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:11:35,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:11:35,879 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:11:35,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:11:35,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:11:35,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:11:35,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:11:35,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:11:35,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:11:35,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:11:35,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:11:35,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:11:35,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:11:35,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:11:35,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:11:35,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:11:35,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:11:35,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-21 18:11:35,909 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:11:35,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:11:35,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:11:35,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:11:35,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:11:35,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:11:35,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:11:35,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:11:35,912 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:11:35,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:11:35,912 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:11:35,912 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:11:35,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:11:35,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:11:35,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:11:35,913 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:11:35,913 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:11:35,914 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:11:35,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:11:35,914 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:11:35,914 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 18:11:35,920 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 18:11:35,922 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:11:35,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:11:35,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:11:35,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:11:35,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:11:35,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:11:35,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:11:35,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:11:35,923 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 18:11:35,923 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 18:11:35,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:11:35,923 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 18:11:35,923 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 -> 0739bef7461b62f52995e3feabe5faf9fb4f95fee3f2cf661c4248d2611e75f6 [2021-12-21 18:11:36,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:11:36,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:11:36,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:11:36,241 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:11:36,241 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:11:36,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2021-12-21 18:11:36,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8539bbe2/6b3b9f854f2643af84b3fc48218b7f27/FLAG890853fa2 [2021-12-21 18:11:36,878 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:11:36,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2021-12-21 18:11:36,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8539bbe2/6b3b9f854f2643af84b3fc48218b7f27/FLAG890853fa2 [2021-12-21 18:11:37,276 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8539bbe2/6b3b9f854f2643af84b3fc48218b7f27 [2021-12-21 18:11:37,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:11:37,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:11:37,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:37,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:11:37,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:11:37,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:37,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d443400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37, skipping insertion in model container [2021-12-21 18:11:37,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:37,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:11:37,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:11:37,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:37,746 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-21 18:11:37,757 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:11:37,798 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:37,813 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:11:37,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:11:37,919 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:11:37,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37 WrapperNode [2021-12-21 18:11:37,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:11:37,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:11:37,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:11:37,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:11:37,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:37,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,006 INFO L137 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 121 [2021-12-21 18:11:38,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:11:38,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:11:38,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:11:38,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:11:38,014 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:11:38,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:11:38,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:11:38,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:11:38,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (1/1) ... [2021-12-21 18:11:38,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:11:38,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:11:38,100 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) [2021-12-21 18:11:38,124 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 [2021-12-21 18:11:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 18:11:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-12-21 18:11:38,142 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-12-21 18:11:38,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-21 18:11:38,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-21 18:11:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-12-21 18:11:38,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-12-21 18:11:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:11:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:11:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:11:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:11:38,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 18:11:38,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:11:38,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 18:11:38,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:11:38,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:11:38,259 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:11:38,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:11:38,635 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:11:38,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:11:38,641 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 18:11:38,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:11:38 BoogieIcfgContainer [2021-12-21 18:11:38,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:11:38,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:11:38,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:11:38,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:11:38,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:11:37" (1/3) ... [2021-12-21 18:11:38,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aa908c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:11:38, skipping insertion in model container [2021-12-21 18:11:38,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:11:37" (2/3) ... [2021-12-21 18:11:38,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aa908c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:11:38, skipping insertion in model container [2021-12-21 18:11:38,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:11:38" (3/3) ... [2021-12-21 18:11:38,649 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2021-12-21 18:11:38,654 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:11:38,654 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-21 18:11:38,689 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:11:38,695 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 18:11:38,695 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-21 18:11:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:11:38,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:38,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:38,713 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash -47219119, now seen corresponding path program 1 times [2021-12-21 18:11:38,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:38,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415234748] [2021-12-21 18:11:38,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:38,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:38,731 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) [2021-12-21 18:11:38,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-21 18:11:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:11:38,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:38,884 INFO L387 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 [2021-12-21 18:11:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:38,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:38,923 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415234748] [2021-12-21 18:11:38,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415234748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:38,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:38,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:11:38,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922617988] [2021-12-21 18:11:38,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:38,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:11:38,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:11:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:11:38,950 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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) [2021-12-21 18:11:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:39,339 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2021-12-21 18:11:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:39,342 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 [2021-12-21 18:11:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:39,352 INFO L225 Difference]: With dead ends: 156 [2021-12-21 18:11:39,352 INFO L226 Difference]: Without dead ends: 154 [2021-12-21 18:11:39,354 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:39,362 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 97 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:39,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 372 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:11:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-21 18:11:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 93. [2021-12-21 18:11:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:11:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-21 18:11:39,410 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2021-12-21 18:11:39,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:39,411 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-21 18:11:39,411 INFO L471 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) [2021-12-21 18:11:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-21 18:11:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:11:39,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:39,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:39,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-21 18:11:39,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:39,613 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash -18589968, now seen corresponding path program 1 times [2021-12-21 18:11:39,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:39,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893325493] [2021-12-21 18:11:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:39,615 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:39,616 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) [2021-12-21 18:11:39,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-21 18:11:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:39,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:11:39,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:39,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:39,742 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:39,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893325493] [2021-12-21 18:11:39,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893325493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:39,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:39,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:11:39,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243197367] [2021-12-21 18:11:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:39,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:11:39,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:39,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:11:39,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:11:39,745 INFO L87 Difference]: Start difference. First operand 93 states and 102 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) [2021-12-21 18:11:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:39,766 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-12-21 18:11:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:11:39,767 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 [2021-12-21 18:11:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:39,768 INFO L225 Difference]: With dead ends: 110 [2021-12-21 18:11:39,768 INFO L226 Difference]: Without dead ends: 110 [2021-12-21 18:11:39,768 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:39,769 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 18 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:39,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 379 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-21 18:11:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2021-12-21 18:11:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:11:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-12-21 18:11:39,776 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 10 [2021-12-21 18:11:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:39,776 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-12-21 18:11:39,777 INFO L471 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) [2021-12-21 18:11:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-12-21 18:11:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 18:11:39,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:39,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:39,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:39,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:39,989 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:39,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1463792640, now seen corresponding path program 1 times [2021-12-21 18:11:39,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:39,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670975448] [2021-12-21 18:11:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:39,990 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:39,991 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) [2021-12-21 18:11:39,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-21 18:11:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:40,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 18:11:40,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:40,076 INFO L387 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 [2021-12-21 18:11:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:40,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:40,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:40,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670975448] [2021-12-21 18:11:40,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670975448] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:40,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:40,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:11:40,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984302593] [2021-12-21 18:11:40,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:40,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:11:40,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:40,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:11:40,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:11:40,178 INFO L87 Difference]: Start difference. First operand 91 states and 99 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) [2021-12-21 18:11:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:40,501 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2021-12-21 18:11:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:40,505 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 [2021-12-21 18:11:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:40,506 INFO L225 Difference]: With dead ends: 128 [2021-12-21 18:11:40,506 INFO L226 Difference]: Without dead ends: 128 [2021-12-21 18:11:40,506 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:40,507 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 71 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:40,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 445 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:11:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-21 18:11:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2021-12-21 18:11:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:11:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2021-12-21 18:11:40,513 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 11 [2021-12-21 18:11:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:40,513 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2021-12-21 18:11:40,513 INFO L471 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) [2021-12-21 18:11:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2021-12-21 18:11:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 18:11:40,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:40,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:40,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:40,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:40,715 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1867041687, now seen corresponding path program 1 times [2021-12-21 18:11:40,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:40,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041725815] [2021-12-21 18:11:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:40,716 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:40,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:40,717 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) [2021-12-21 18:11:40,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-21 18:11:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:40,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:11:40,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:40,844 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:40,844 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041725815] [2021-12-21 18:11:40,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041725815] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:40,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:40,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:11:40,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625732848] [2021-12-21 18:11:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:40,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:11:40,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:40,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:11:40,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:11:40,847 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2021-12-21 18:11:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:40,866 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-12-21 18:11:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:11:40,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2021-12-21 18:11:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:40,868 INFO L225 Difference]: With dead ends: 109 [2021-12-21 18:11:40,868 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 18:11:40,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:11:40,874 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 34 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:40,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 18:11:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2021-12-21 18:11:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:11:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2021-12-21 18:11:40,881 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2021-12-21 18:11:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:40,881 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2021-12-21 18:11:40,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2021-12-21 18:11:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2021-12-21 18:11:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 18:11:40,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:40,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:40,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:41,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:41,091 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash -685115274, now seen corresponding path program 1 times [2021-12-21 18:11:41,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:41,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470466615] [2021-12-21 18:11:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:41,092 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:41,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:41,093 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) [2021-12-21 18:11:41,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-21 18:11:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:41,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 18:11:41,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:41,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:41,206 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:41,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470466615] [2021-12-21 18:11:41,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470466615] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:41,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:41,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:11:41,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816149922] [2021-12-21 18:11:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:41,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:11:41,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:11:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:11:41,209 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2021-12-21 18:11:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:41,235 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2021-12-21 18:11:41,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:11:41,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2021-12-21 18:11:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:41,236 INFO L225 Difference]: With dead ends: 106 [2021-12-21 18:11:41,236 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 18:11:41,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:11:41,239 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 18 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:41,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 273 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 18:11:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2021-12-21 18:11:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:11:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-12-21 18:11:41,249 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 12 [2021-12-21 18:11:41,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:41,250 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-12-21 18:11:41,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2021-12-21 18:11:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-12-21 18:11:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 18:11:41,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:41,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:41,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:41,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:41,451 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2102322433, now seen corresponding path program 1 times [2021-12-21 18:11:41,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:41,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512963997] [2021-12-21 18:11:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:41,453 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:41,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:41,454 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) [2021-12-21 18:11:41,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-21 18:11:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:41,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:11:41,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:41,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:41,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:41,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512963997] [2021-12-21 18:11:41,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512963997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:41,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:41,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:11:41,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665239876] [2021-12-21 18:11:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:41,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:11:41,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:41,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:11:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:11:41,554 INFO L87 Difference]: Start difference. First operand 92 states and 99 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) [2021-12-21 18:11:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:41,574 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-12-21 18:11:41,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:11:41,575 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 [2021-12-21 18:11:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:41,575 INFO L225 Difference]: With dead ends: 100 [2021-12-21 18:11:41,575 INFO L226 Difference]: Without dead ends: 100 [2021-12-21 18:11:41,576 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:41,577 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:41,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 197 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-21 18:11:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-12-21 18:11:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:11:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-12-21 18:11:41,598 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 16 [2021-12-21 18:11:41,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:41,599 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-12-21 18:11:41,599 INFO L471 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) [2021-12-21 18:11:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-12-21 18:11:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-21 18:11:41,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:41,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:41,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:41,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:41,802 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:41,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash -806745110, now seen corresponding path program 1 times [2021-12-21 18:11:41,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:41,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522009652] [2021-12-21 18:11:41,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:41,803 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:41,804 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) [2021-12-21 18:11:41,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-21 18:11:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:41,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:11:41,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:41,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:11:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:41,988 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:41,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522009652] [2021-12-21 18:11:41,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522009652] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:11:41,989 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:11:41,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-21 18:11:41,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948591845] [2021-12-21 18:11:41,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:11:41,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:11:41,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:11:41,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:11:41,990 INFO L87 Difference]: Start difference. First operand 93 states and 100 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) [2021-12-21 18:11:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:42,049 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2021-12-21 18:11:42,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:42,050 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 [2021-12-21 18:11:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:42,051 INFO L225 Difference]: With dead ends: 103 [2021-12-21 18:11:42,051 INFO L226 Difference]: Without dead ends: 103 [2021-12-21 18:11:42,052 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:42,052 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 32 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:42,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 525 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-21 18:11:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2021-12-21 18:11:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 89 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:11:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2021-12-21 18:11:42,056 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 17 [2021-12-21 18:11:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:42,056 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2021-12-21 18:11:42,056 INFO L471 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) [2021-12-21 18:11:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2021-12-21 18:11:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 18:11:42,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:42,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:42,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:42,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:42,266 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1874334272, now seen corresponding path program 1 times [2021-12-21 18:11:42,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:42,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969081982] [2021-12-21 18:11:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:42,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:42,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:42,268 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) [2021-12-21 18:11:42,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-21 18:11:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:42,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:11:42,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:42,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:42,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:42,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969081982] [2021-12-21 18:11:42,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969081982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:42,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:42,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:11:42,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638690464] [2021-12-21 18:11:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:42,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:11:42,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:11:42,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:11:42,423 INFO L87 Difference]: Start difference. First operand 96 states and 103 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, (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) [2021-12-21 18:11:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:42,468 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2021-12-21 18:11:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:42,468 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, (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 18 [2021-12-21 18:11:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:42,469 INFO L225 Difference]: With dead ends: 109 [2021-12-21 18:11:42,469 INFO L226 Difference]: Without dead ends: 109 [2021-12-21 18:11:42,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:11:42,470 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 15 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:42,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 450 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-21 18:11:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2021-12-21 18:11:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 96 states have internal predecessors, (102), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:11:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2021-12-21 18:11:42,473 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 18 [2021-12-21 18:11:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:42,474 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2021-12-21 18:11:42,474 INFO L471 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, (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) [2021-12-21 18:11:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2021-12-21 18:11:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 18:11:42,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:42,474 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:42,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:42,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:42,684 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:42,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2116321857, now seen corresponding path program 2 times [2021-12-21 18:11:42,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:42,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576301786] [2021-12-21 18:11:42,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:11:42,685 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:42,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:42,686 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) [2021-12-21 18:11:42,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-21 18:11:42,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 18:11:42,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:11:42,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 18:11:42,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:42,773 INFO L387 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 [2021-12-21 18:11:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 18:11:42,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:42,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:42,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576301786] [2021-12-21 18:11:42,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576301786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:42,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:42,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:11:42,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716464593] [2021-12-21 18:11:42,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:42,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:11:42,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:42,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:11:42,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:11:42,859 INFO L87 Difference]: Start difference. First operand 104 states and 111 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) [2021-12-21 18:11:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:43,190 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2021-12-21 18:11:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:11:43,190 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 [2021-12-21 18:11:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:43,191 INFO L225 Difference]: With dead ends: 138 [2021-12-21 18:11:43,191 INFO L226 Difference]: Without dead ends: 138 [2021-12-21 18:11:43,191 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:43,192 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 95 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:43,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 516 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:11:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-21 18:11:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 103. [2021-12-21 18:11:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 95 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:11:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2021-12-21 18:11:43,196 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 20 [2021-12-21 18:11:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:43,197 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2021-12-21 18:11:43,197 INFO L471 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) [2021-12-21 18:11:43,197 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2021-12-21 18:11:43,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 18:11:43,198 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:43,198 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:43,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:43,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:43,403 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2116321856, now seen corresponding path program 1 times [2021-12-21 18:11:43,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:43,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299752100] [2021-12-21 18:11:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:43,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:43,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:43,405 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) [2021-12-21 18:11:43,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-21 18:11:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:43,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:11:43,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:43,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:11:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:43,769 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:43,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299752100] [2021-12-21 18:11:43,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299752100] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:11:43,770 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:11:43,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-21 18:11:43,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228193538] [2021-12-21 18:11:43,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:11:43,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 18:11:43,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:43,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 18:11:43,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:11:43,772 INFO L87 Difference]: Start difference. First operand 103 states and 110 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) [2021-12-21 18:11:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:43,978 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2021-12-21 18:11:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:11:43,979 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 [2021-12-21 18:11:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:43,980 INFO L225 Difference]: With dead ends: 112 [2021-12-21 18:11:43,980 INFO L226 Difference]: Without dead ends: 112 [2021-12-21 18:11:43,980 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:43,981 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 62 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:43,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 646 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:11:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-21 18:11:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2021-12-21 18:11:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 101 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-21 18:11:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2021-12-21 18:11:43,985 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 20 [2021-12-21 18:11:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:43,985 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2021-12-21 18:11:43,985 INFO L471 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) [2021-12-21 18:11:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2021-12-21 18:11:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 18:11:43,986 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:43,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:43,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:44,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:44,192 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:44,192 INFO L85 PathProgramCache]: Analyzing trace with hash 623421782, now seen corresponding path program 1 times [2021-12-21 18:11:44,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:44,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482731426] [2021-12-21 18:11:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:44,193 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:44,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:44,194 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) [2021-12-21 18:11:44,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-21 18:11:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:44,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:11:44,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:44,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:44,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:44,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482731426] [2021-12-21 18:11:44,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482731426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:44,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:44,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:11:44,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563496816] [2021-12-21 18:11:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:44,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:11:44,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:44,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:11:44,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:11:44,309 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:11:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:44,413 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-12-21 18:11:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:11:44,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-12-21 18:11:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:44,414 INFO L225 Difference]: With dead ends: 115 [2021-12-21 18:11:44,414 INFO L226 Difference]: Without dead ends: 99 [2021-12-21 18:11:44,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:11:44,415 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 31 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:44,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:11:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-21 18:11:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2021-12-21 18:11:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 89 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-12-21 18:11:44,418 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 21 [2021-12-21 18:11:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:44,418 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-12-21 18:11:44,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:11:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-12-21 18:11:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:11:44,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:44,419 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:44,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:44,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:44,624 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1324432864, now seen corresponding path program 2 times [2021-12-21 18:11:44,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:44,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417155207] [2021-12-21 18:11:44,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:11:44,625 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:44,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:44,626 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) [2021-12-21 18:11:44,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-21 18:11:44,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 18:11:44,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:11:44,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 18:11:44,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:44,731 INFO L387 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 [2021-12-21 18:11:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-21 18:11:44,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:44,941 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417155207] [2021-12-21 18:11:44,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417155207] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:44,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:44,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:11:44,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434883888] [2021-12-21 18:11:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:44,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:11:44,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:44,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:11:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:44,942 INFO L87 Difference]: Start difference. First operand 95 states and 101 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) [2021-12-21 18:11:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:45,372 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2021-12-21 18:11:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:11:45,372 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 [2021-12-21 18:11:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:45,373 INFO L225 Difference]: With dead ends: 135 [2021-12-21 18:11:45,373 INFO L226 Difference]: Without dead ends: 135 [2021-12-21 18:11:45,374 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:45,374 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 101 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:45,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 594 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:11:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-21 18:11:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2021-12-21 18:11:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.4029850746268657) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2021-12-21 18:11:45,378 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 26 [2021-12-21 18:11:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:45,378 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2021-12-21 18:11:45,379 INFO L471 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) [2021-12-21 18:11:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2021-12-21 18:11:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:11:45,379 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:45,379 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:45,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:45,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:45,587 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1468154655, now seen corresponding path program 1 times [2021-12-21 18:11:45,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:45,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586268435] [2021-12-21 18:11:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:45,588 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:45,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:45,589 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) [2021-12-21 18:11:45,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-21 18:11:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:45,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 18:11:45,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:45,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:11:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:11:46,439 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:46,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586268435] [2021-12-21 18:11:46,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586268435] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:11:46,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:11:46,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-21 18:11:46,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143507562] [2021-12-21 18:11:46,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:11:46,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 18:11:46,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:46,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 18:11:46,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-12-21 18:11:46,441 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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) [2021-12-21 18:11:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:46,835 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-12-21 18:11:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:11:46,836 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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 28 [2021-12-21 18:11:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:46,840 INFO L225 Difference]: With dead ends: 100 [2021-12-21 18:11:46,841 INFO L226 Difference]: Without dead ends: 100 [2021-12-21 18:11:46,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2021-12-21 18:11:46,842 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 30 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:46,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 1375 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:11:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-21 18:11:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-21 18:11:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.36986301369863) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-12-21 18:11:46,846 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 28 [2021-12-21 18:11:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:46,846 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-12-21 18:11:46,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 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) [2021-12-21 18:11:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-12-21 18:11:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:11:46,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:46,847 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:46,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:47,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:47,057 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash 459662143, now seen corresponding path program 2 times [2021-12-21 18:11:47,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:47,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374935513] [2021-12-21 18:11:47,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:11:47,058 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:47,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:47,059 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) [2021-12-21 18:11:47,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-21 18:11:47,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 18:11:47,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:11:47,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:11:47,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:47,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:47,218 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:47,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374935513] [2021-12-21 18:11:47,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374935513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:47,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:47,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:11:47,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935585020] [2021-12-21 18:11:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:47,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:11:47,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:11:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:11:47,221 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2021-12-21 18:11:47,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:47,245 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-12-21 18:11:47,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:11:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 34 [2021-12-21 18:11:47,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:47,247 INFO L225 Difference]: With dead ends: 100 [2021-12-21 18:11:47,247 INFO L226 Difference]: Without dead ends: 100 [2021-12-21 18:11:47,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:11:47,248 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 51 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:47,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 361 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-21 18:11:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-21 18:11:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.356164383561644) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2021-12-21 18:11:47,251 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 34 [2021-12-21 18:11:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:47,251 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2021-12-21 18:11:47,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) [2021-12-21 18:11:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2021-12-21 18:11:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:11:47,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:47,252 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:47,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:47,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:47,462 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:47,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash 802453767, now seen corresponding path program 1 times [2021-12-21 18:11:47,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:47,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149065886] [2021-12-21 18:11:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:47,463 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:47,464 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) [2021-12-21 18:11:47,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-21 18:11:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:47,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 18:11:47,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:47,643 INFO L387 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 [2021-12-21 18:11:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:47,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:47,771 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:47,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149065886] [2021-12-21 18:11:47,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149065886] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:47,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:47,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:11:47,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163731606] [2021-12-21 18:11:47,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:47,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:11:47,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:47,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:11:47,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:47,773 INFO L87 Difference]: Start difference. First operand 100 states and 105 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) [2021-12-21 18:11:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:48,032 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-12-21 18:11:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:11:48,032 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 [2021-12-21 18:11:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:48,033 INFO L225 Difference]: With dead ends: 98 [2021-12-21 18:11:48,033 INFO L226 Difference]: Without dead ends: 98 [2021-12-21 18:11:48,033 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:48,034 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 77 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:48,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 367 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:11:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-21 18:11:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-12-21 18:11:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 92 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-12-21 18:11:48,036 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 36 [2021-12-21 18:11:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:48,036 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-12-21 18:11:48,037 INFO L471 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) [2021-12-21 18:11:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-12-21 18:11:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:11:48,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:48,037 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:48,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:48,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:48,238 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 802453768, now seen corresponding path program 1 times [2021-12-21 18:11:48,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:48,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773993533] [2021-12-21 18:11:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:48,238 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:48,239 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) [2021-12-21 18:11:48,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-21 18:11:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:48,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-21 18:11:48,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:48,403 INFO L387 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 [2021-12-21 18:11:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:48,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:48,631 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:48,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773993533] [2021-12-21 18:11:48,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773993533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:48,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:48,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:11:48,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63313826] [2021-12-21 18:11:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:48,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:11:48,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:11:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:11:48,633 INFO L87 Difference]: Start difference. First operand 98 states and 103 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) [2021-12-21 18:11:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:48,943 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-12-21 18:11:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:11:48,944 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 [2021-12-21 18:11:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:48,945 INFO L225 Difference]: With dead ends: 96 [2021-12-21 18:11:48,945 INFO L226 Difference]: Without dead ends: 96 [2021-12-21 18:11:48,945 INFO L932 BasicCegarLoop]: 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 [2021-12-21 18:11:48,946 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:48,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 463 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 18:11:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-21 18:11:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-21 18:11:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-12-21 18:11:48,948 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2021-12-21 18:11:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:48,948 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-12-21 18:11:48,949 INFO L471 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) [2021-12-21 18:11:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-12-21 18:11:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:11:48,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:48,949 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:48,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:49,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:49,160 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash 751746667, now seen corresponding path program 1 times [2021-12-21 18:11:49,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383017221] [2021-12-21 18:11:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:49,161 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:49,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:49,162 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) [2021-12-21 18:11:49,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-21 18:11:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:49,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:11:49,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:49,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:49,368 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:49,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383017221] [2021-12-21 18:11:49,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383017221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:49,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:49,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:11:49,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638521083] [2021-12-21 18:11:49,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:49,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:11:49,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:49,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:11:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:11:49,370 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2021-12-21 18:11:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:49,410 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-12-21 18:11:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 36 [2021-12-21 18:11:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:49,411 INFO L225 Difference]: With dead ends: 96 [2021-12-21 18:11:49,411 INFO L226 Difference]: Without dead ends: 96 [2021-12-21 18:11:49,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:49,412 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 72 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:49,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 390 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-21 18:11:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-21 18:11:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 89 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2021-12-21 18:11:49,415 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 36 [2021-12-21 18:11:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:49,415 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2021-12-21 18:11:49,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2021-12-21 18:11:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2021-12-21 18:11:49,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 18:11:49,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:49,416 INFO L514 BasicCegarLoop]: 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] [2021-12-21 18:11:49,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-21 18:11:49,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:49,627 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1769826328, now seen corresponding path program 1 times [2021-12-21 18:11:49,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:49,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832737546] [2021-12-21 18:11:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:49,627 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:49,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:49,628 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) [2021-12-21 18:11:49,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-21 18:11:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:49,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-21 18:11:49,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:49,838 INFO L387 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 [2021-12-21 18:11:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:49,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:49,993 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:49,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832737546] [2021-12-21 18:11:49,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832737546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:49,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:49,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 18:11:49,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058733181] [2021-12-21 18:11:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:49,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:11:49,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:11:49,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:49,995 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:11:50,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:50,182 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-12-21 18:11:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:11:50,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-21 18:11:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:50,183 INFO L225 Difference]: With dead ends: 98 [2021-12-21 18:11:50,184 INFO L226 Difference]: Without dead ends: 98 [2021-12-21 18:11:50,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:11:50,184 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 65 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:50,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 291 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 20 Unchecked, 0.2s Time] [2021-12-21 18:11:50,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-21 18:11:50,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-21 18:11:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-21 18:11:50,188 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 44 [2021-12-21 18:11:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:50,188 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-21 18:11:50,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:11:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-21 18:11:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-21 18:11:50,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:50,189 INFO L514 BasicCegarLoop]: 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] [2021-12-21 18:11:50,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:50,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:50,391 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1769826327, now seen corresponding path program 1 times [2021-12-21 18:11:50,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:50,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982017562] [2021-12-21 18:11:50,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:50,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:50,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:50,394 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) [2021-12-21 18:11:50,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-21 18:11:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:50,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:11:50,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:50,634 INFO L387 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 [2021-12-21 18:11:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:50,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:50,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982017562] [2021-12-21 18:11:50,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982017562] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:50,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:50,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:11:50,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030779505] [2021-12-21 18:11:50,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:50,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:11:50,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:50,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:11:50,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:11:50,915 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:11:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:51,138 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2021-12-21 18:11:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:11:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-21 18:11:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:51,139 INFO L225 Difference]: With dead ends: 99 [2021-12-21 18:11:51,139 INFO L226 Difference]: Without dead ends: 99 [2021-12-21 18:11:51,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:11:51,140 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:51,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 315 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2021-12-21 18:11:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-21 18:11:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2021-12-21 18:11:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-12-21 18:11:51,147 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 44 [2021-12-21 18:11:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:51,147 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-12-21 18:11:51,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:11:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-12-21 18:11:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-21 18:11:51,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:51,148 INFO L514 BasicCegarLoop]: 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] [2021-12-21 18:11:51,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:51,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:51,356 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash -84693070, now seen corresponding path program 1 times [2021-12-21 18:11:51,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:51,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629678133] [2021-12-21 18:11:51,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:51,356 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:51,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:51,357 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) [2021-12-21 18:11:51,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-21 18:11:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:51,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 18:11:51,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:51,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:51,639 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629678133] [2021-12-21 18:11:51,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629678133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:51,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:51,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:11:51,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144935561] [2021-12-21 18:11:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:51,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:11:51,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:11:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:11:51,640 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:11:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:51,678 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2021-12-21 18:11:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:11:51,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 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 50 [2021-12-21 18:11:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:51,680 INFO L225 Difference]: With dead ends: 92 [2021-12-21 18:11:51,680 INFO L226 Difference]: Without dead ends: 92 [2021-12-21 18:11:51,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:51,680 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 39 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:51,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 383 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-21 18:11:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-21 18:11:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2021-12-21 18:11:51,683 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 50 [2021-12-21 18:11:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:51,684 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2021-12-21 18:11:51,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:11:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2021-12-21 18:11:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-21 18:11:51,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:51,685 INFO L514 BasicCegarLoop]: 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] [2021-12-21 18:11:51,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:51,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:51,896 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1460412904, now seen corresponding path program 1 times [2021-12-21 18:11:51,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:51,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304737532] [2021-12-21 18:11:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:51,897 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:51,898 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) [2021-12-21 18:11:51,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-21 18:11:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:52,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 18:11:52,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:52,120 INFO L387 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 [2021-12-21 18:11:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:52,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:52,300 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:52,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304737532] [2021-12-21 18:11:52,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304737532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:52,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:52,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:11:52,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942000083] [2021-12-21 18:11:52,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:52,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:11:52,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:11:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:11:52,302 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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) [2021-12-21 18:11:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:52,567 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2021-12-21 18:11:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:11:52,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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 56 [2021-12-21 18:11:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:52,568 INFO L225 Difference]: With dead ends: 99 [2021-12-21 18:11:52,568 INFO L226 Difference]: Without dead ends: 99 [2021-12-21 18:11:52,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:11:52,569 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:52,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 314 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2021-12-21 18:11:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-21 18:11:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2021-12-21 18:11:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 83 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2021-12-21 18:11:52,571 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 56 [2021-12-21 18:11:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:52,571 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2021-12-21 18:11:52,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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) [2021-12-21 18:11:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2021-12-21 18:11:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-21 18:11:52,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:52,572 INFO L514 BasicCegarLoop]: 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] [2021-12-21 18:11:52,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:52,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:52,783 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1460412903, now seen corresponding path program 1 times [2021-12-21 18:11:52,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:52,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909687651] [2021-12-21 18:11:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:52,784 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:52,785 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) [2021-12-21 18:11:52,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-21 18:11:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:53,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:11:53,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:53,035 INFO L387 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 [2021-12-21 18:11:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:53,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:53,346 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909687651] [2021-12-21 18:11:53,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909687651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:53,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:53,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:11:53,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869091973] [2021-12-21 18:11:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:53,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:11:53,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:53,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:11:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:11:53,348 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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) [2021-12-21 18:11:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:53,617 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2021-12-21 18:11:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:11:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 56 [2021-12-21 18:11:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:53,619 INFO L225 Difference]: With dead ends: 90 [2021-12-21 18:11:53,619 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 18:11:53,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:11:53,619 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 140 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:53,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 380 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2021-12-21 18:11:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 18:11:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-12-21 18:11:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 81 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-12-21 18:11:53,622 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 56 [2021-12-21 18:11:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:53,623 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-12-21 18:11:53,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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) [2021-12-21 18:11:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-12-21 18:11:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 18:11:53,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:53,623 INFO L514 BasicCegarLoop]: 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] [2021-12-21 18:11:53,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-21 18:11:53,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:53,827 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:53,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash 903789054, now seen corresponding path program 1 times [2021-12-21 18:11:53,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:53,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768597713] [2021-12-21 18:11:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:53,829 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:53,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:53,830 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) [2021-12-21 18:11:53,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-21 18:11:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:54,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:11:54,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:54,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:54,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:54,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768597713] [2021-12-21 18:11:54,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768597713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:54,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:54,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:11:54,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504652923] [2021-12-21 18:11:54,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:54,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:11:54,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:54,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:11:54,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:11:54,189 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:54,254 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2021-12-21 18:11:54,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:11:54,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2021-12-21 18:11:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:54,255 INFO L225 Difference]: With dead ends: 90 [2021-12-21 18:11:54,255 INFO L226 Difference]: Without dead ends: 88 [2021-12-21 18:11:54,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:11:54,256 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 63 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:54,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 448 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:11:54,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-21 18:11:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-21 18:11:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.1506849315068493) internal successors, (84), 81 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2021-12-21 18:11:54,259 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 59 [2021-12-21 18:11:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:54,259 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2021-12-21 18:11:54,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2021-12-21 18:11:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-21 18:11:54,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:54,260 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-21 18:11:54,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:54,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:54,473 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash -132393604, now seen corresponding path program 1 times [2021-12-21 18:11:54,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:54,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591855664] [2021-12-21 18:11:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:54,474 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:54,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:54,475 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) [2021-12-21 18:11:54,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-21 18:11:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:54,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 18:11:54,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:54,845 INFO L387 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 [2021-12-21 18:11:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:55,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:55,043 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:55,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591855664] [2021-12-21 18:11:55,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591855664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:55,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:55,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:11:55,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609740361] [2021-12-21 18:11:55,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:55,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:11:55,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:55,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:11:55,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:11:55,044 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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) [2021-12-21 18:11:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:55,316 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2021-12-21 18:11:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:11:55,316 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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 62 [2021-12-21 18:11:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:55,317 INFO L225 Difference]: With dead ends: 93 [2021-12-21 18:11:55,317 INFO L226 Difference]: Without dead ends: 93 [2021-12-21 18:11:55,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:11:55,318 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 93 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:55,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 323 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2021-12-21 18:11:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-21 18:11:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2021-12-21 18:11:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 79 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2021-12-21 18:11:55,328 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 62 [2021-12-21 18:11:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:55,328 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2021-12-21 18:11:55,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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) [2021-12-21 18:11:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2021-12-21 18:11:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-21 18:11:55,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:55,329 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-21 18:11:55,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:55,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:55,542 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:55,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash -132393603, now seen corresponding path program 1 times [2021-12-21 18:11:55,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888291015] [2021-12-21 18:11:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:55,543 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:55,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:55,544 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:11:55,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-21 18:11:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:55,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-21 18:11:55,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:55,842 INFO L387 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 [2021-12-21 18:11:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:56,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:56,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:56,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888291015] [2021-12-21 18:11:56,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888291015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:56,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:56,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-21 18:11:56,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694484282] [2021-12-21 18:11:56,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:56,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:11:56,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:56,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:11:56,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:11:56,212 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 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) [2021-12-21 18:11:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:56,541 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2021-12-21 18:11:56,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:11:56,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 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 62 [2021-12-21 18:11:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:56,543 INFO L225 Difference]: With dead ends: 88 [2021-12-21 18:11:56,543 INFO L226 Difference]: Without dead ends: 88 [2021-12-21 18:11:56,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-21 18:11:56,545 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 141 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:56,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 367 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2021-12-21 18:11:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-21 18:11:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2021-12-21 18:11:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.095890410958904) internal successors, (80), 77 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2021-12-21 18:11:56,549 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 62 [2021-12-21 18:11:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:56,549 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-12-21 18:11:56,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 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) [2021-12-21 18:11:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2021-12-21 18:11:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-21 18:11:56,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:56,552 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:56,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-21 18:11:56,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:56,766 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1357800525, now seen corresponding path program 1 times [2021-12-21 18:11:56,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:56,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420223592] [2021-12-21 18:11:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:56,767 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:56,768 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) [2021-12-21 18:11:56,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-21 18:11:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:11:57,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-21 18:11:57,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:11:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-21 18:11:57,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:11:57,554 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:11:57,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420223592] [2021-12-21 18:11:57,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420223592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:11:57,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:11:57,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:11:57,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238254894] [2021-12-21 18:11:57,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:11:57,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:11:57,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:11:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:11:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:11:57,556 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 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) [2021-12-21 18:11:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:11:57,850 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2021-12-21 18:11:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:11:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 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 65 [2021-12-21 18:11:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:11:57,852 INFO L225 Difference]: With dead ends: 87 [2021-12-21 18:11:57,852 INFO L226 Difference]: Without dead ends: 87 [2021-12-21 18:11:57,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-21 18:11:57,853 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 192 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:11:57,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 379 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2021-12-21 18:11:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-21 18:11:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2021-12-21 18:11:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.082191780821918) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:11:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2021-12-21 18:11:57,856 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 65 [2021-12-21 18:11:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:11:57,856 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2021-12-21 18:11:57,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 10 states have internal predecessors, (45), 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) [2021-12-21 18:11:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2021-12-21 18:11:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-21 18:11:57,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:11:57,857 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:11:57,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-21 18:11:58,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:58,071 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-21 18:11:58,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:11:58,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1678173622, now seen corresponding path program 1 times [2021-12-21 18:11:58,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:11:58,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610218354] [2021-12-21 18:11:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:11:58,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:11:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:11:58,073 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) [2021-12-21 18:11:58,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-21 18:11:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:11:58,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 18:11:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:11:58,915 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-21 18:11:58,916 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 18:11:58,917 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (24 of 25 remaining) [2021-12-21 18:11:58,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2021-12-21 18:11:58,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2021-12-21 18:11:58,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (21 of 25 remaining) [2021-12-21 18:11:58,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (20 of 25 remaining) [2021-12-21 18:11:58,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (19 of 25 remaining) [2021-12-21 18:11:58,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (18 of 25 remaining) [2021-12-21 18:11:58,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (17 of 25 remaining) [2021-12-21 18:11:58,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (16 of 25 remaining) [2021-12-21 18:11:58,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (15 of 25 remaining) [2021-12-21 18:11:58,919 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION (14 of 25 remaining) [2021-12-21 18:11:58,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION (13 of 25 remaining) [2021-12-21 18:11:58,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION (12 of 25 remaining) [2021-12-21 18:11:58,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr0REQUIRES_VIOLATION (11 of 25 remaining) [2021-12-21 18:11:58,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATION (10 of 25 remaining) [2021-12-21 18:11:58,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATION (9 of 25 remaining) [2021-12-21 18:11:58,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATION (8 of 25 remaining) [2021-12-21 18:11:58,920 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATION (7 of 25 remaining) [2021-12-21 18:11:58,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATION (6 of 25 remaining) [2021-12-21 18:11:58,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2021-12-21 18:11:58,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2021-12-21 18:11:58,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2021-12-21 18:11:58,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2021-12-21 18:11:58,921 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2021-12-21 18:11:58,922 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2021-12-21 18:11:58,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-21 18:11:59,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:11:59,143 INFO L732 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] [2021-12-21 18:11:59,145 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 18:11:59,153 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,154 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,155 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,156 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,157 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,158 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,159 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,160 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,161 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,162 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,163 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,164 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,165 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,166 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,167 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,168 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,169 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,169 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,169 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,169 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,170 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,171 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,172 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,173 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,173 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,173 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,173 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,173 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,174 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,174 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,174 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,174 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,174 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,174 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,175 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,175 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,175 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,175 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,175 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,176 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,177 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,178 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,179 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-21 18:11:59,180 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,181 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-21 18:11:59,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:11:59 BoogieIcfgContainer [2021-12-21 18:11:59,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 18:11:59,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 18:11:59,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 18:11:59,210 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 18:11:59,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:11:38" (3/4) ... [2021-12-21 18:11:59,213 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 18:11:59,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 18:11:59,213 INFO L158 Benchmark]: Toolchain (without parser) took 21931.32ms. Allocated memory was 60.8MB in the beginning and 98.6MB in the end (delta: 37.7MB). Free memory was 39.0MB in the beginning and 39.7MB in the end (delta: -735.2kB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2021-12-21 18:11:59,214 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:11:59,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.09ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 25.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-21 18:11:59,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.38ms. Allocated memory is still 60.8MB. Free memory was 25.4MB in the beginning and 42.0MB in the end (delta: -16.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-12-21 18:11:59,214 INFO L158 Benchmark]: Boogie Preprocessor took 59.00ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 39.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:11:59,215 INFO L158 Benchmark]: RCFGBuilder took 576.56ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 39.7MB in the beginning and 58.1MB in the end (delta: -18.3MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2021-12-21 18:11:59,215 INFO L158 Benchmark]: TraceAbstraction took 20564.67ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 57.6MB in the beginning and 40.7MB in the end (delta: 16.9MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2021-12-21 18:11:59,215 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 98.6MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:11:59,216 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.20ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.09ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 25.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.38ms. Allocated memory is still 60.8MB. Free memory was 25.4MB in the beginning and 42.0MB in the end (delta: -16.6MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.00ms. Allocated memory is still 60.8MB. Free memory was 42.0MB in the beginning and 39.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 576.56ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 39.7MB in the beginning and 58.1MB in the end (delta: -18.3MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20564.67ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 57.6MB in the beginning and 40.7MB in the end (delta: 16.9MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 98.6MB. Free memory is still 39.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#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_#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_#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_#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_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 769. Possible 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_get(kobj) [L758] CALL ldv_kobject_get(kobj) [L717] COND TRUE \read(*kobj) [L718] CALL ldv_kref_get(&kobj->kref) [L686] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L657] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L658] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=1] [L658] temp = v->counter [L659] temp += i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=2, v={2:12}, v={2:12}] [L660] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=2, v={2:12}, v={2:12}] [L661] return temp; VAL [\old(i)=1, \result=2, i=1, ldv_global_msg_list={1:0}, temp=2, v={2:12}, v={2:12}] [L686] RET ldv_atomic_add_return(1, (&kref->refcount)) [L718] RET ldv_kref_get(&kobj->kref) [L719] return kobj; VAL [\result={2:0}, kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L758] RET ldv_kobject_get(kobj) [L766] RET f_22_get(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, 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=2] [L666] temp = v->counter [L667] temp -= i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=1, v={2:12}, v={2:12}] [L668] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=1, v={2:12}, v={2:12}] [L669] return temp; VAL [\old(i)=1, \result=1, i=1, ldv_global_msg_list={1:0}, temp=1, v={2:12}, v={2:12}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L678] return 0; VAL [\old(count)=1, \result=0, 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) [L767] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L770] RET entry_point() - 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: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 666]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 666]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: 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, 90 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 27, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1843 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1828 mSDsluCounter, 11138 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 84 IncrementalHoareTripleChecker+Unchecked, 9036 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3017 IncrementalHoareTripleChecker+Invalid, 3259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 2102 mSDtfsCounter, 3017 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 703 SyntacticMatches, 12 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=10, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 290 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 928 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 897 ConstructedInterpolants, 35 QuantifiedInterpolants, 4501 SizeOfPredicates, 208 NumberOfNonLiveVariables, 5389 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1833/1965 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 could not prove your program: unable to determine feasibility of some traces [2021-12-21 18:11:59,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample