./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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_test11_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:30:13,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:30:13,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:30:13,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:30:13,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:30:13,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:30:13,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:30:13,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:30:13,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:30:13,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:30:13,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:30:13,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:30:13,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:30:13,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:30:13,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:30:13,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:30:13,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:30:13,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:30:13,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:30:13,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:30:13,682 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:30:13,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:30:13,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:30:13,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:30:13,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:30:13,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:30:13,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:30:13,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:30:13,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:30:13,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:30:13,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:30:13,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:30:13,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:30:13,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:30:13,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:30:13,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:30:13,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:30:13,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:30:13,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:30:13,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:30:13,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:30:13,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:30:13,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:30:13,733 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:30:13,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:30:13,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:30:13,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:30:13,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:30:13,736 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:30:13,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:30:13,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:30:13,737 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:30:13,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:30:13,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:30:13,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:30:13,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:30:13,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:30:13,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:30:13,739 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:30:13,739 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:30:13,739 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:30:13,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:30:13,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:30:13,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:30:13,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:30:13,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:30:13,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:30:13,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:30:13,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:30:13,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:30:13,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:30:13,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:30:13,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:30:13,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2022-07-14 06:30:13,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:30:13,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:30:13,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:30:13,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:30:13,931 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:30:13,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-07-14 06:30:13,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b60d1007/21e9fc8e55144a0ab067169d72653048/FLAGf2063e848 [2022-07-14 06:30:14,375 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:30:14,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-07-14 06:30:14,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b60d1007/21e9fc8e55144a0ab067169d72653048/FLAGf2063e848 [2022-07-14 06:30:14,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b60d1007/21e9fc8e55144a0ab067169d72653048 [2022-07-14 06:30:14,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:30:14,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:30:14,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:30:14,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:30:14,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:30:14,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:30:14" (1/1) ... [2022-07-14 06:30:14,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7e8806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:14, skipping insertion in model container [2022-07-14 06:30:14,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:30:14" (1/1) ... [2022-07-14 06:30:14,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:30:14,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:30:15,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:30:15,107 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-14 06:30:15,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@76a61d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:15, skipping insertion in model container [2022-07-14 06:30:15,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:30:15,109 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 06:30:15,111 INFO L158 Benchmark]: Toolchain (without parser) took 388.17ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.5MB in the beginning and 82.8MB in the end (delta: -24.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 06:30:15,112 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory was 46.4MB in the beginning and 46.3MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:30:15,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.53ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.3MB in the beginning and 82.8MB in the end (delta: -24.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 06:30:15,114 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.15ms. Allocated memory is still 92.3MB. Free memory was 46.4MB in the beginning and 46.3MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.53ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.3MB in the beginning and 82.8MB in the end (delta: -24.5MB). 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 of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:30:16,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:30:16,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:30:16,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:30:16,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:30:16,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:30:16,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:30:16,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:30:16,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:30:16,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:30:16,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:30:16,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:30:16,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:30:16,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:30:16,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:30:16,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:30:16,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:30:16,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:30:16,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:30:16,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:30:16,636 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:30:16,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:30:16,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:30:16,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:30:16,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:30:16,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:30:16,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:30:16,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:30:16,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:30:16,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:30:16,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:30:16,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:30:16,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:30:16,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:30:16,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:30:16,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:30:16,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:30:16,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:30:16,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:30:16,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:30:16,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:30:16,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:30:16,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:30:16,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:30:16,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:30:16,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:30:16,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:30:16,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:30:16,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:30:16,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:30:16,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:30:16,686 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:30:16,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:30:16,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:30:16,687 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:30:16,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:30:16,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:30:16,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:30:16,688 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:30:16,688 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:30:16,688 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:30:16,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:30:16,688 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:30:16,689 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:30:16,689 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:30:16,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:30:16,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:30:16,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:30:16,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:30:16,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:30:16,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:30:16,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:30:16,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:30:16,690 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:30:16,691 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:30:16,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:30:16,691 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 02acfb70bf31515ceb84abad2b1306b0eab86ac3ab86c4ec829443e87c9da071 [2022-07-14 06:30:16,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:30:16,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:30:16,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:30:16,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:30:16,949 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:30:16,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-07-14 06:30:16,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b1d399c/0966e5bfed64477b9cc350fc1e5afff3/FLAG6c5603738 [2022-07-14 06:30:17,446 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:30:17,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2022-07-14 06:30:17,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b1d399c/0966e5bfed64477b9cc350fc1e5afff3/FLAG6c5603738 [2022-07-14 06:30:17,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b1d399c/0966e5bfed64477b9cc350fc1e5afff3 [2022-07-14 06:30:17,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:30:17,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:30:17,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:30:17,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:30:17,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:30:17,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:30:17" (1/1) ... [2022-07-14 06:30:17,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ffb57d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:17, skipping insertion in model container [2022-07-14 06:30:17,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:30:17" (1/1) ... [2022-07-14 06:30:17,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:30:17,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:30:18,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:30:18,154 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 06:30:18,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:30:18,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:30:18,222 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:30:18,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:30:18,299 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:30:18,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18 WrapperNode [2022-07-14 06:30:18,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:30:18,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:30:18,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:30:18,301 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:30:18,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,364 INFO L137 Inliner]: procedures = 169, calls = 88, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 96 [2022-07-14 06:30:18,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:30:18,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:30:18,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:30:18,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:30:18,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:30:18,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:30:18,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:30:18,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:30:18,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (1/1) ... [2022-07-14 06:30:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:30:18,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:30:18,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:30:18,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:30:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 06:30:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 06:30:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2022-07-14 06:30:18,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2022-07-14 06:30:18,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:30:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:30:18,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:30:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:30:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:30:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:30:18,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:30:18,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:30:18,594 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:30:18,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:30:18,808 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:30:18,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:30:18,813 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 06:30:18,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:30:18 BoogieIcfgContainer [2022-07-14 06:30:18,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:30:18,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:30:18,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:30:18,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:30:18,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:30:17" (1/3) ... [2022-07-14 06:30:18,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5294f680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:30:18, skipping insertion in model container [2022-07-14 06:30:18,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:30:18" (2/3) ... [2022-07-14 06:30:18,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5294f680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:30:18, skipping insertion in model container [2022-07-14 06:30:18,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:30:18" (3/3) ... [2022-07-14 06:30:18,828 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2022-07-14 06:30:18,837 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:30:18,839 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-14 06:30:18,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:30:18,894 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b755d0b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5eae1879 [2022-07-14 06:30:18,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-14 06:30:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:30:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:30:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:18,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:18,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2113619829, now seen corresponding path program 1 times [2022-07-14 06:30:18,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011946577] [2022-07-14 06:30:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:18,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:18,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:18,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:30:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:18,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:30:18,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:19,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:30:19,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:19,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011946577] [2022-07-14 06:30:19,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011946577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:30:19,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:30:19,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:30:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237515729] [2022-07-14 06:30:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:30:19,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:30:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:19,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:30:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:19,085 INFO L87 Difference]: Start difference. First operand has 90 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:30:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:19,201 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2022-07-14 06:30:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:30:19,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-14 06:30:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:19,210 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:30:19,210 INFO L226 Difference]: Without dead ends: 163 [2022-07-14 06:30:19,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:19,213 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 73 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:19,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 478 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:30:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-14 06:30:19,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2022-07-14 06:30:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-14 06:30:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-07-14 06:30:19,243 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 11 [2022-07-14 06:30:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:19,244 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-07-14 06:30:19,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:30:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-07-14 06:30:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:30:19,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:19,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:19,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 06:30:19,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:19,446 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1293843786, now seen corresponding path program 1 times [2022-07-14 06:30:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:19,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519470160] [2022-07-14 06:30:19,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:19,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:19,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:19,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:19,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:30:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:19,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:30:19,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:19,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:30:19,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:19,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519470160] [2022-07-14 06:30:19,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519470160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:30:19,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:30:19,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:30:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592670379] [2022-07-14 06:30:19,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:30:19,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:30:19,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:19,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:30:19,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:30:19,525 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:30:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:19,762 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2022-07-14 06:30:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:30:19,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-14 06:30:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:19,764 INFO L225 Difference]: With dead ends: 163 [2022-07-14 06:30:19,764 INFO L226 Difference]: Without dead ends: 161 [2022-07-14 06:30:19,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:30:19,765 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 70 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:19,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 321 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:30:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-14 06:30:19,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 88. [2022-07-14 06:30:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.68) internal successors, (84), 79 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:30:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-07-14 06:30:19,773 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 11 [2022-07-14 06:30:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:19,773 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-07-14 06:30:19,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:30:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-07-14 06:30:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:30:19,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:19,774 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:19,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:19,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:19,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:19,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026591, now seen corresponding path program 1 times [2022-07-14 06:30:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:19,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425457535] [2022-07-14 06:30:19,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:19,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:19,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:19,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) [2022-07-14 06:30:19,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:30:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:20,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:30:20,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:30:20,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:30:20,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:20,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425457535] [2022-07-14 06:30:20,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425457535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:30:20,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:30:20,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:30:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691138534] [2022-07-14 06:30:20,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:30:20,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:30:20,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:30:20,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:20,065 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:30:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:20,139 INFO L93 Difference]: Finished difference Result 160 states and 180 transitions. [2022-07-14 06:30:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:30:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-07-14 06:30:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:20,143 INFO L225 Difference]: With dead ends: 160 [2022-07-14 06:30:20,143 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 06:30:20,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:20,144 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 68 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:20,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 369 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:30:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 06:30:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 92. [2022-07-14 06:30:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.6415094339622642) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-14 06:30:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-07-14 06:30:20,152 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 17 [2022-07-14 06:30:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:20,152 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-07-14 06:30:20,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:30:20,152 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-07-14 06:30:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:30:20,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:20,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:20,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-14 06:30:20,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:20,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:20,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:20,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026607, now seen corresponding path program 1 times [2022-07-14 06:30:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:20,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672687749] [2022-07-14 06:30:20,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:20,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:20,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:20,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:20,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:30:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:20,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:30:20,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:20,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:20,531 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:30:20,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-14 06:30:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:20,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:20,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:20,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672687749] [2022-07-14 06:30:20,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672687749] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:30:20,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:20,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-07-14 06:30:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458114337] [2022-07-14 06:30:20,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:20,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:30:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:30:20,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:30:20,748 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:30:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:20,886 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-07-14 06:30:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:30:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-07-14 06:30:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:20,888 INFO L225 Difference]: With dead ends: 112 [2022-07-14 06:30:20,888 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 06:30:20,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:30:20,889 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:20,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 326 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-07-14 06:30:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 06:30:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-14 06:30:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 95 states have internal predecessors, (106), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2022-07-14 06:30:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2022-07-14 06:30:20,895 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 17 [2022-07-14 06:30:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:20,895 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2022-07-14 06:30:20,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:30:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2022-07-14 06:30:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:30:20,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:20,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:20,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:21,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:21,114 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:21,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1793026606, now seen corresponding path program 1 times [2022-07-14 06:30:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:21,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652640031] [2022-07-14 06:30:21,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:21,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:21,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:21,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:30:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:21,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:30:21,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:21,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:21,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:21,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:30:21,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:30:21,323 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:30:21,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:30:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:21,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:23,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:23,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652640031] [2022-07-14 06:30:23,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652640031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:23,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [214607519] [2022-07-14 06:30:23,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:23,566 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:30:23,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:30:23,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:30:23,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-07-14 06:30:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:23,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:30:23,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:23,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:23,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:23,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:30:23,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:30:23,879 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:30:23,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:30:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:23,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:26,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [214607519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:26,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:26,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-14 06:30:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463129608] [2022-07-14 06:30:26,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:26,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:30:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:26,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:30:26,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2022-07-14 06:30:26,101 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:30:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:26,923 INFO L93 Difference]: Finished difference Result 203 states and 225 transitions. [2022-07-14 06:30:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:30:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-07-14 06:30:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:26,925 INFO L225 Difference]: With dead ends: 203 [2022-07-14 06:30:26,925 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 06:30:26,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2022-07-14 06:30:26,926 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 162 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:26,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 616 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 413 Invalid, 0 Unknown, 80 Unchecked, 0.7s Time] [2022-07-14 06:30:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 06:30:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 145. [2022-07-14 06:30:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 127 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-14 06:30:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2022-07-14 06:30:26,934 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 17 [2022-07-14 06:30:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:26,934 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2022-07-14 06:30:26,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:30:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2022-07-14 06:30:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:30:26,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:26,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:26,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-07-14 06:30:27,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:27,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:27,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2086429614, now seen corresponding path program 1 times [2022-07-14 06:30:27,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:27,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861326949] [2022-07-14 06:30:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:27,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:27,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:27,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:27,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:30:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:27,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:30:27,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:27,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:30:27,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:27,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861326949] [2022-07-14 06:30:27,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861326949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:30:27,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:30:27,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:30:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387292303] [2022-07-14 06:30:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:30:27,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:30:27,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:30:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:27,449 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:30:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:27,491 INFO L93 Difference]: Finished difference Result 136 states and 175 transitions. [2022-07-14 06:30:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:30:27,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-07-14 06:30:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:27,493 INFO L225 Difference]: With dead ends: 136 [2022-07-14 06:30:27,493 INFO L226 Difference]: Without dead ends: 134 [2022-07-14 06:30:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:27,493 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:27,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:30:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-14 06:30:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-14 06:30:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 92 states have (on average 1.641304347826087) internal successors, (151), 119 states have internal predecessors, (151), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-07-14 06:30:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2022-07-14 06:30:27,502 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 17 [2022-07-14 06:30:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:27,503 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2022-07-14 06:30:27,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:30:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2022-07-14 06:30:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:30:27,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:27,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:27,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:27,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:27,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1138254343, now seen corresponding path program 1 times [2022-07-14 06:30:27,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:27,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128389325] [2022-07-14 06:30:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:27,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:27,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:27,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:30:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:27,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:30:27,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:27,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:30:28,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:28,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128389325] [2022-07-14 06:30:28,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128389325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:30:28,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:28,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-07-14 06:30:28,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090942424] [2022-07-14 06:30:28,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:28,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:30:28,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:28,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:30:28,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:30:28,050 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:30:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:28,258 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2022-07-14 06:30:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:30:28,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 18 [2022-07-14 06:30:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:28,260 INFO L225 Difference]: With dead ends: 139 [2022-07-14 06:30:28,260 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 06:30:28,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:30:28,260 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 71 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:28,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 344 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 14 Unchecked, 0.2s Time] [2022-07-14 06:30:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 06:30:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-14 06:30:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 95 states have (on average 1.6) internal successors, (152), 121 states have internal predecessors, (152), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-07-14 06:30:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 174 transitions. [2022-07-14 06:30:28,265 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 174 transitions. Word has length 18 [2022-07-14 06:30:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:28,266 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 174 transitions. [2022-07-14 06:30:28,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:30:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 174 transitions. [2022-07-14 06:30:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:30:28,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:28,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:28,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:28,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:28,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash 968466533, now seen corresponding path program 1 times [2022-07-14 06:30:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:28,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959522978] [2022-07-14 06:30:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:28,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:28,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:28,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:28,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:30:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:28,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:30:28,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:30:28,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:32,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:32,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959522978] [2022-07-14 06:30:32,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959522978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:32,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1639395903] [2022-07-14 06:30:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:32,862 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:30:32,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:30:32,863 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:30:32,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-14 06:30:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:32,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:30:32,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:30:33,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:37,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1639395903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:37,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:37,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-07-14 06:30:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687908143] [2022-07-14 06:30:37,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:30:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:37,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:30:37,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=166, Unknown=2, NotChecked=0, Total=210 [2022-07-14 06:30:37,304 INFO L87 Difference]: Start difference. First operand 137 states and 174 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:30:37,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:37,541 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2022-07-14 06:30:37,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:30:37,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2022-07-14 06:30:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:37,543 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:30:37,543 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:30:37,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=50, Invalid=220, Unknown=2, NotChecked=0, Total=272 [2022-07-14 06:30:37,544 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 12 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:37,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 551 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 177 Unchecked, 0.2s Time] [2022-07-14 06:30:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:30:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2022-07-14 06:30:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 115 states have internal predecessors, (145), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:30:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 166 transitions. [2022-07-14 06:30:37,550 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 166 transitions. Word has length 21 [2022-07-14 06:30:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:37,550 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 166 transitions. [2022-07-14 06:30:37,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:30:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 166 transitions. [2022-07-14 06:30:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:30:37,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:37,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:37,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-07-14 06:30:37,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:37,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:37,953 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:37,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash -406257806, now seen corresponding path program 1 times [2022-07-14 06:30:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:37,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546999040] [2022-07-14 06:30:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:37,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:37,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:37,955 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:37,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:30:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:38,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:30:38,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:38,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:38,113 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:30:38,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 06:30:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:30:38,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:30:38,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:38,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546999040] [2022-07-14 06:30:38,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546999040] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:30:38,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:38,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-07-14 06:30:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823554259] [2022-07-14 06:30:38,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:38,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:30:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:30:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:30:38,285 INFO L87 Difference]: Start difference. First operand 130 states and 166 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:30:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:38,470 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2022-07-14 06:30:38,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:30:38,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-07-14 06:30:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:38,472 INFO L225 Difference]: With dead ends: 157 [2022-07-14 06:30:38,472 INFO L226 Difference]: Without dead ends: 157 [2022-07-14 06:30:38,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:30:38,473 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:38,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 302 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2022-07-14 06:30:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-14 06:30:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2022-07-14 06:30:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5963302752293578) internal successors, (174), 135 states have internal predecessors, (174), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-14 06:30:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 199 transitions. [2022-07-14 06:30:38,478 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 199 transitions. Word has length 25 [2022-07-14 06:30:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:38,479 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 199 transitions. [2022-07-14 06:30:38,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:30:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 199 transitions. [2022-07-14 06:30:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:30:38,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:38,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:38,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:38,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:38,680 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:38,681 INFO L85 PathProgramCache]: Analyzing trace with hash -406257805, now seen corresponding path program 1 times [2022-07-14 06:30:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:38,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82417654] [2022-07-14 06:30:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:38,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:38,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:38,682 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:38,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:30:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:38,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:30:38,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:38,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:42,958 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:30:42,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:30:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:30:43,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:43,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:43,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82417654] [2022-07-14 06:30:43,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82417654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:43,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [371253937] [2022-07-14 06:30:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:30:43,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:30:43,277 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:30:43,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-07-14 06:30:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:43,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:30:43,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:43,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:43,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:49,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:30:49,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:30:49,736 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:30:49,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:30:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:30:49,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:52,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [371253937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:52,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:52,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-14 06:30:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192174273] [2022-07-14 06:30:52,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:30:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:52,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:30:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=224, Unknown=5, NotChecked=0, Total=272 [2022-07-14 06:30:52,698 INFO L87 Difference]: Start difference. First operand 154 states and 199 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:30:55,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:55,491 INFO L93 Difference]: Finished difference Result 279 states and 359 transitions. [2022-07-14 06:30:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:30:55,491 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-07-14 06:30:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:55,493 INFO L225 Difference]: With dead ends: 279 [2022-07-14 06:30:55,493 INFO L226 Difference]: Without dead ends: 279 [2022-07-14 06:30:55,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=56, Invalid=280, Unknown=6, NotChecked=0, Total=342 [2022-07-14 06:30:55,493 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 94 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:55,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 531 Invalid, 0 Unknown, 121 Unchecked, 0.7s Time] [2022-07-14 06:30:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-14 06:30:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 212. [2022-07-14 06:30:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 161 states have (on average 1.6149068322981366) internal successors, (260), 187 states have internal predecessors, (260), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2022-07-14 06:30:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 299 transitions. [2022-07-14 06:30:55,499 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 299 transitions. Word has length 25 [2022-07-14 06:30:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:55,499 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 299 transitions. [2022-07-14 06:30:55,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:30:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 299 transitions. [2022-07-14 06:30:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:30:55,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:55,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:55,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:55,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:55,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:55,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:55,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash -911816431, now seen corresponding path program 1 times [2022-07-14 06:30:55,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:55,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521064425] [2022-07-14 06:30:55,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:55,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:55,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:55,906 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:55,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:30:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:55,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:30:55,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:30:56,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:30:56,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:56,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521064425] [2022-07-14 06:30:56,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521064425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:30:56,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:30:56,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:30:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925503792] [2022-07-14 06:30:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:30:56,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:30:56,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:56,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:30:56,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:56,026 INFO L87 Difference]: Start difference. First operand 212 states and 299 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:30:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:56,063 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2022-07-14 06:30:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:30:56,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-14 06:30:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:56,065 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:30:56,065 INFO L226 Difference]: Without dead ends: 163 [2022-07-14 06:30:56,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:56,066 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:56,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 356 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:30:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-14 06:30:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-14 06:30:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 120 states have (on average 1.5666666666666667) internal successors, (188), 144 states have internal predecessors, (188), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-14 06:30:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2022-07-14 06:30:56,070 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 25 [2022-07-14 06:30:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:56,070 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2022-07-14 06:30:56,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:30:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2022-07-14 06:30:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:30:56,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:56,071 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:56,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:56,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:56,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 290909999, now seen corresponding path program 1 times [2022-07-14 06:30:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:56,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158472545] [2022-07-14 06:30:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:56,273 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:56,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:30:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:56,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:30:56,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:30:56,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:30:56,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:56,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158472545] [2022-07-14 06:30:56,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158472545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:30:56,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:30:56,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:30:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274072156] [2022-07-14 06:30:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:30:56,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:30:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:56,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:30:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:56,339 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:30:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:56,385 INFO L93 Difference]: Finished difference Result 212 states and 260 transitions. [2022-07-14 06:30:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:30:56,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-07-14 06:30:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:56,386 INFO L225 Difference]: With dead ends: 212 [2022-07-14 06:30:56,386 INFO L226 Difference]: Without dead ends: 212 [2022-07-14 06:30:56,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:30:56,387 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 59 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:56,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 408 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:30:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-14 06:30:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 160. [2022-07-14 06:30:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.564102564102564) internal successors, (183), 141 states have internal predecessors, (183), 11 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-14 06:30:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 208 transitions. [2022-07-14 06:30:56,391 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 208 transitions. Word has length 26 [2022-07-14 06:30:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:56,391 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 208 transitions. [2022-07-14 06:30:56,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 06:30:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 208 transitions. [2022-07-14 06:30:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:30:56,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:56,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:56,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:56,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:56,602 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1178413680, now seen corresponding path program 1 times [2022-07-14 06:30:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276533904] [2022-07-14 06:30:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:56,604 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:56,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 06:30:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:56,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:30:56,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:30:57,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:30:57,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:57,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276533904] [2022-07-14 06:30:57,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276533904] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:30:57,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:57,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-07-14 06:30:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479175310] [2022-07-14 06:30:57,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:57,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:30:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:30:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:30:57,229 INFO L87 Difference]: Start difference. First operand 160 states and 208 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:30:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:57,343 INFO L93 Difference]: Finished difference Result 199 states and 249 transitions. [2022-07-14 06:30:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:30:57,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2022-07-14 06:30:57,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:57,344 INFO L225 Difference]: With dead ends: 199 [2022-07-14 06:30:57,344 INFO L226 Difference]: Without dead ends: 199 [2022-07-14 06:30:57,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:30:57,345 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 65 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:57,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 507 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2022-07-14 06:30:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-14 06:30:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2022-07-14 06:30:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.5537190082644627) internal successors, (188), 145 states have internal predecessors, (188), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-14 06:30:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 213 transitions. [2022-07-14 06:30:57,349 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 213 transitions. Word has length 26 [2022-07-14 06:30:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:57,349 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 213 transitions. [2022-07-14 06:30:57,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:30:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2022-07-14 06:30:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:30:57,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:57,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:57,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-14 06:30:57,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:57,557 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:57,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:57,557 INFO L85 PathProgramCache]: Analyzing trace with hash 428272563, now seen corresponding path program 1 times [2022-07-14 06:30:57,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:57,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855374022] [2022-07-14 06:30:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:57,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:57,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:57,559 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:57,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 06:30:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:57,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:30:57,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:57,691 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:30:57,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 06:30:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:30:57,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:30:57,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:30:57,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855374022] [2022-07-14 06:30:57,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855374022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:30:57,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:30:57,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:30:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774474032] [2022-07-14 06:30:57,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:30:57,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:30:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:30:57,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:30:57,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:30:57,719 INFO L87 Difference]: Start difference. First operand 165 states and 213 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:30:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:57,921 INFO L93 Difference]: Finished difference Result 203 states and 255 transitions. [2022-07-14 06:30:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:30:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-14 06:30:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:57,922 INFO L225 Difference]: With dead ends: 203 [2022-07-14 06:30:57,922 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 06:30:57,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:30:57,923 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 90 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:57,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 315 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-07-14 06:30:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 06:30:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 164. [2022-07-14 06:30:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 121 states have (on average 1.537190082644628) internal successors, (186), 144 states have internal predecessors, (186), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2022-07-14 06:30:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 211 transitions. [2022-07-14 06:30:57,927 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 211 transitions. Word has length 27 [2022-07-14 06:30:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:57,927 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 211 transitions. [2022-07-14 06:30:57,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:30:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 211 transitions. [2022-07-14 06:30:57,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:30:57,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:57,928 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:57,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:30:58,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:30:58,135 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:30:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 428272564, now seen corresponding path program 1 times [2022-07-14 06:30:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:30:58,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363843064] [2022-07-14 06:30:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:58,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:30:58,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:30:58,136 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:30:58,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 06:30:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:58,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:30:58,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:58,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:30:58,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:00,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:31:00,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:31:00,422 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:31:00,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:31:02,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:31:02,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:31:02,556 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:31:02,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:31:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:31:02,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:07,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:31:07,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363843064] [2022-07-14 06:31:07,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363843064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:07,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [585155047] [2022-07-14 06:31:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:31:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:31:07,081 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:31:07,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-14 06:31:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:07,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:31:07,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:31:07,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:07,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:07,387 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:31:07,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:31:07,408 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:31:07,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:31:07,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:31:07,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:31:07,555 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:31:07,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:31:07,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:31:07,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:10,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [585155047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:10,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:31:10,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2022-07-14 06:31:10,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774112297] [2022-07-14 06:31:10,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:31:10,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:31:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:31:10,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:31:10,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=173, Unknown=2, NotChecked=0, Total=210 [2022-07-14 06:31:10,009 INFO L87 Difference]: Start difference. First operand 164 states and 211 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:31:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:31:10,805 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2022-07-14 06:31:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:31:10,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-07-14 06:31:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:31:10,807 INFO L225 Difference]: With dead ends: 222 [2022-07-14 06:31:10,807 INFO L226 Difference]: Without dead ends: 222 [2022-07-14 06:31:10,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=60, Invalid=280, Unknown=2, NotChecked=0, Total=342 [2022-07-14 06:31:10,807 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 188 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:31:10,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 880 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 527 Invalid, 0 Unknown, 133 Unchecked, 0.7s Time] [2022-07-14 06:31:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-14 06:31:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 133. [2022-07-14 06:31:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 116 states have internal predecessors, (140), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-14 06:31:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2022-07-14 06:31:10,811 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 27 [2022-07-14 06:31:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:31:10,811 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2022-07-14 06:31:10,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:31:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2022-07-14 06:31:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:31:10,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:31:10,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:31:10,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:31:11,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:31:11,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:31:11,215 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:31:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:31:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash -746927052, now seen corresponding path program 1 times [2022-07-14 06:31:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:31:11,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756872309] [2022-07-14 06:31:11,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:11,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:31:11,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:31:11,217 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:31:11,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:31:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:11,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:31:11,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:31:11,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:31:11,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:11,531 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 06:31:11,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2022-07-14 06:31:11,643 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:31:11,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2022-07-14 06:31:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:31:11,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:12,051 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-07-14 06:31:12,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 64 [2022-07-14 06:31:12,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:31:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756872309] [2022-07-14 06:31:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756872309] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [274044261] [2022-07-14 06:31:12,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:12,156 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:31:12,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:31:12,160 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:31:12,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-07-14 06:31:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:12,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:31:12,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:31:12,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:12,488 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:31:12,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:31:12,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:31:14,663 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32))))) is different from true [2022-07-14 06:31:14,784 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:31:14,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:31:14,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:31:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-14 06:31:15,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:15,042 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-14 06:31:15,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:31:15,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_252 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_252) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) is different from false [2022-07-14 06:31:15,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [274044261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:15,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:31:15,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2022-07-14 06:31:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294558133] [2022-07-14 06:31:15,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:31:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:31:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:31:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:31:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=897, Unknown=2, NotChecked=122, Total=1122 [2022-07-14 06:31:15,071 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:31:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:31:27,415 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2022-07-14 06:31:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:31:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2022-07-14 06:31:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:31:27,416 INFO L225 Difference]: With dead ends: 168 [2022-07-14 06:31:27,416 INFO L226 Difference]: Without dead ends: 168 [2022-07-14 06:31:27,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=305, Invalid=1954, Unknown=5, NotChecked=186, Total=2450 [2022-07-14 06:31:27,418 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 113 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:31:27,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1318 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1037 Invalid, 0 Unknown, 155 Unchecked, 1.3s Time] [2022-07-14 06:31:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-14 06:31:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 135. [2022-07-14 06:31:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 118 states have internal predecessors, (142), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-14 06:31:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2022-07-14 06:31:27,422 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 29 [2022-07-14 06:31:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:31:27,422 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2022-07-14 06:31:27,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:31:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2022-07-14 06:31:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:31:27,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:31:27,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:31:27,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:31:27,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:31:27,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:31:27,826 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:31:27,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:31:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash -746927051, now seen corresponding path program 1 times [2022-07-14 06:31:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:31:27,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636989502] [2022-07-14 06:31:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:27,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:31:27,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:31:27,832 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:31:27,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:31:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:27,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:31:27,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:31:27,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:28,012 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:31:28,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:31:28,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:31:28,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:31:28,320 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:31:28,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:31:28,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:31:28,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:31:28,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:31:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:31:28,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:28,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:31:28,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-07-14 06:31:28,997 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_1) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (or (forall ((v_ArrVal_276 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_276) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (_ bv0 32))))) is different from false [2022-07-14 06:31:29,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:31:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636989502] [2022-07-14 06:31:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636989502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [480430105] [2022-07-14 06:31:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:31:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:31:29,074 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:31:29,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-14 06:31:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 06:31:29,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:31:29,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:29,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:31:31,543 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:31:31,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-14 06:31:31,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:31:31,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:31:31,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-14 06:31:31,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:31:36,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:31:36,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:31:36,229 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:31:36,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:31:36,391 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:31:36,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:31:36,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:31:36,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:31:36,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:31:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:31:36,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:36,729 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_304) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_304) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-14 06:31:36,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_308 (_ BitVec 32)) (|v_ldv_malloc_#res.base_89| (_ BitVec 32))) (or (and (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_304) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_304) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (select (store |c_#length| |v_ldv_malloc_#res.base_89| v_ArrVal_308) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_305) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ldv_malloc_#res.base_89|)))))) is different from false [2022-07-14 06:31:36,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [480430105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:36,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:31:36,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2022-07-14 06:31:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50282638] [2022-07-14 06:31:36,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:31:36,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 06:31:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:31:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 06:31:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1013, Unknown=5, NotChecked=198, Total=1332 [2022-07-14 06:31:36,860 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:31:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:31:42,930 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2022-07-14 06:31:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:31:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2022-07-14 06:31:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:31:42,932 INFO L225 Difference]: With dead ends: 143 [2022-07-14 06:31:42,932 INFO L226 Difference]: Without dead ends: 143 [2022-07-14 06:31:42,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=253, Invalid=1733, Unknown=6, NotChecked=264, Total=2256 [2022-07-14 06:31:42,933 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 131 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:31:42,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 982 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 852 Invalid, 0 Unknown, 170 Unchecked, 1.1s Time] [2022-07-14 06:31:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-14 06:31:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2022-07-14 06:31:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 97 states have (on average 1.443298969072165) internal successors, (140), 116 states have internal predecessors, (140), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-14 06:31:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2022-07-14 06:31:42,935 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 29 [2022-07-14 06:31:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:31:42,936 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2022-07-14 06:31:42,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 06:31:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2022-07-14 06:31:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:31:42,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:31:42,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:31:42,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:31:43,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-14 06:31:43,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:31:43,339 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:31:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:31:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1269350632, now seen corresponding path program 1 times [2022-07-14 06:31:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:31:43,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959397799] [2022-07-14 06:31:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:31:43,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:31:43,340 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:31:43,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 06:31:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:43,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:31:43,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:31:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:31:45,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:48,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:31:48,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959397799] [2022-07-14 06:31:48,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959397799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:48,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1291002227] [2022-07-14 06:31:48,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:48,075 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:31:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:31:48,076 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:31:48,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-14 06:31:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:48,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:31:48,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:32:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:32:05,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:32:09,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-07-14 06:32:11,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1291002227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:32:11,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:32:11,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2022-07-14 06:32:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156849865] [2022-07-14 06:32:11,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:32:11,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:32:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:32:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:32:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=783, Unknown=11, NotChecked=0, Total=930 [2022-07-14 06:32:11,888 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:32:12,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:32:12,070 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2022-07-14 06:32:12,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:32:12,071 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2022-07-14 06:32:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:32:12,072 INFO L225 Difference]: With dead ends: 136 [2022-07-14 06:32:12,072 INFO L226 Difference]: Without dead ends: 128 [2022-07-14 06:32:12,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=145, Invalid=900, Unknown=11, NotChecked=0, Total=1056 [2022-07-14 06:32:12,072 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:32:12,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 652 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 300 Unchecked, 0.1s Time] [2022-07-14 06:32:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-14 06:32:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2022-07-14 06:32:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 107 states have internal predecessors, (130), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-14 06:32:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2022-07-14 06:32:12,075 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 32 [2022-07-14 06:32:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:32:12,076 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2022-07-14 06:32:12,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:32:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2022-07-14 06:32:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:32:12,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:32:12,076 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:32:12,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 06:32:12,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-07-14 06:32:12,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:32:12,484 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:32:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:32:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash 411440938, now seen corresponding path program 1 times [2022-07-14 06:32:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:32:12,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775468508] [2022-07-14 06:32:12,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:32:12,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:32:12,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:32:12,486 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:32:12,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 06:32:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:32:12,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 06:32:12,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:32:12,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:32:12,646 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:32:12,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:32:12,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:32:12,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:32:14,724 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_30|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_17|)))) is different from true [2022-07-14 06:32:14,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:32:18,911 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-14 06:32:18,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-07-14 06:32:18,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-07-14 06:32:19,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-07-14 06:32:19,144 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:32:19,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2022-07-14 06:32:19,339 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:32:19,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2022-07-14 06:32:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-07-14 06:32:19,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:32:24,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 77 [2022-07-14 06:32:24,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_34| (_ BitVec 32)) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_34|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_375) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) is different from false [2022-07-14 06:32:24,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:32:24,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775468508] [2022-07-14 06:32:24,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775468508] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:32:24,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1846248152] [2022-07-14 06:32:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:32:24,480 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:32:24,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:32:24,481 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:32:24,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-14 06:32:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:32:24,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 06:32:24,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:32:24,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:32:26,863 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:32:26,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:32:26,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:32:27,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:32:29,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:32:29,768 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 06:32:29,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-07-14 06:32:29,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2022-07-14 06:32:30,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-07-14 06:32:30,332 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:32:30,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2022-07-14 06:32:34,535 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:32:34,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-14 06:32:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:32:34,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:32:35,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |c_ULTIMATE.start_entry_point_~fe~1#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_408) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-14 06:32:35,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 77 [2022-07-14 06:32:35,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret45#1.base_37| (_ BitVec 32)) (v_ArrVal_375 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base|) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| |v_ULTIMATE.start_entry_point_#t~ret45#1.base_37|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_375) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)))) is different from false [2022-07-14 06:32:35,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1846248152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:32:35,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:32:35,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2022-07-14 06:32:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019470422] [2022-07-14 06:32:35,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:32:35,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 06:32:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:32:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 06:32:35,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1647, Unknown=32, NotChecked=340, Total=2162 [2022-07-14 06:32:35,447 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-14 06:32:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:32:49,670 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2022-07-14 06:32:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:32:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2022-07-14 06:32:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:32:49,672 INFO L225 Difference]: With dead ends: 179 [2022-07-14 06:32:49,672 INFO L226 Difference]: Without dead ends: 179 [2022-07-14 06:32:49,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=230, Invalid=2200, Unknown=36, NotChecked=396, Total=2862 [2022-07-14 06:32:49,673 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 61 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:32:49,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 932 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 703 Invalid, 0 Unknown, 413 Unchecked, 1.1s Time] [2022-07-14 06:32:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-14 06:32:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2022-07-14 06:32:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 121 states have internal predecessors, (149), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:32:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2022-07-14 06:32:49,678 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 38 [2022-07-14 06:32:49,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:32:49,678 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2022-07-14 06:32:49,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 31 states have internal predecessors, (50), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-14 06:32:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2022-07-14 06:32:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:32:49,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:32:49,679 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:32:49,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2022-07-14 06:32:49,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-14 06:32:50,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:32:50,079 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:32:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:32:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 411440939, now seen corresponding path program 1 times [2022-07-14 06:32:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:32:50,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132815857] [2022-07-14 06:32:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:32:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:32:50,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:32:50,082 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:32:50,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 06:32:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:32:50,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-14 06:32:50,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:32:50,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:32:50,269 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:32:50,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:32:50,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:32:50,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:32:52,341 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|) |v_ULTIMATE.start_entry_point_~c11~0#1.offset_BEFORE_CALL_20|) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_34|))) is different from true [2022-07-14 06:32:54,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:32:54,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:32:56,634 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-14 06:32:56,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-14 06:32:56,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2022-07-14 06:32:56,972 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-14 06:32:56,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2022-07-14 06:32:56,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-14 06:32:57,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:32:57,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:32:57,266 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:32:57,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 06:32:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 06:32:57,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:32:59,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:32:59,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132815857] [2022-07-14 06:32:59,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132815857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:32:59,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2079005931] [2022-07-14 06:32:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:32:59,785 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:32:59,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:32:59,786 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:32:59,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-14 06:32:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:32:59,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-14 06:32:59,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:32:59,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:00,142 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:00,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:00,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:33:00,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:33:02,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:02,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:03,146 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 06:33:03,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-14 06:33:03,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2022-07-14 06:33:03,751 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:33:03,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2022-07-14 06:33:03,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-14 06:33:03,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:03,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:03,958 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:03,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 06:33:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:33:03,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:08,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2079005931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:33:08,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:33:08,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 39 [2022-07-14 06:33:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299484224] [2022-07-14 06:33:08,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:33:08,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 06:33:08,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:08,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 06:33:08,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1512, Unknown=3, NotChecked=78, Total=1722 [2022-07-14 06:33:08,380 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand has 40 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 32 states have internal predecessors, (49), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:16,571 INFO L93 Difference]: Finished difference Result 227 states and 274 transitions. [2022-07-14 06:33:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:33:16,572 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 32 states have internal predecessors, (49), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 38 [2022-07-14 06:33:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:16,573 INFO L225 Difference]: With dead ends: 227 [2022-07-14 06:33:16,573 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 06:33:16,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=211, Invalid=2140, Unknown=5, NotChecked=94, Total=2450 [2022-07-14 06:33:16,574 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 108 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 611 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:16,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2281 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1065 Invalid, 0 Unknown, 611 Unchecked, 1.3s Time] [2022-07-14 06:33:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 06:33:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 140. [2022-07-14 06:33:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 121 states have internal predecessors, (147), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-14 06:33:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2022-07-14 06:33:16,577 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 38 [2022-07-14 06:33:16,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:16,577 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2022-07-14 06:33:16,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 32 states have internal predecessors, (49), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:16,578 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2022-07-14 06:33:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 06:33:16,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:16,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:16,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:16,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-14 06:33:16,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:16,981 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash -433030933, now seen corresponding path program 1 times [2022-07-14 06:33:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:16,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131911209] [2022-07-14 06:33:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:16,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:16,983 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-14 06:33:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:17,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:33:17,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:33:17,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:17,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:17,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131911209] [2022-07-14 06:33:17,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131911209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:17,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:17,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:33:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887093572] [2022-07-14 06:33:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:17,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:33:17,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:33:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:17,099 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:33:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:17,131 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2022-07-14 06:33:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:33:17,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-07-14 06:33:17,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:17,132 INFO L225 Difference]: With dead ends: 125 [2022-07-14 06:33:17,132 INFO L226 Difference]: Without dead ends: 121 [2022-07-14 06:33:17,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:17,133 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:17,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:33:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-14 06:33:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-14 06:33:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 105 states have internal predecessors, (125), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-07-14 06:33:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2022-07-14 06:33:17,135 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 38 [2022-07-14 06:33:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:17,135 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2022-07-14 06:33:17,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:33:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2022-07-14 06:33:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:33:17,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:17,136 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:17,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:17,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:17,344 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:17,345 INFO L85 PathProgramCache]: Analyzing trace with hash 257770205, now seen corresponding path program 1 times [2022-07-14 06:33:17,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:17,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176477471] [2022-07-14 06:33:17,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:17,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:17,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:17,353 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:17,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-14 06:33:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:17,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:33:17,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:17,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:17,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:17,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176477471] [2022-07-14 06:33:17,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176477471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:17,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:17,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:33:17,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519834674] [2022-07-14 06:33:17,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:17,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:33:17,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:17,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:33:17,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:17,483 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 06:33:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:17,546 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-07-14 06:33:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:33:17,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-07-14 06:33:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:17,547 INFO L225 Difference]: With dead ends: 137 [2022-07-14 06:33:17,547 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 06:33:17,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:17,548 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:17,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 389 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:33:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 06:33:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2022-07-14 06:33:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 104 states have internal predecessors, (123), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2022-07-14 06:33:17,550 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 40 [2022-07-14 06:33:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:17,550 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2022-07-14 06:33:17,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-14 06:33:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2022-07-14 06:33:17,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:33:17,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:17,551 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:17,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:17,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:17,758 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2000580540, now seen corresponding path program 1 times [2022-07-14 06:33:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:17,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108773905] [2022-07-14 06:33:17,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:17,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:17,760 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:17,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-14 06:33:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:17,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:33:17,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:33:17,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:17,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:17,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108773905] [2022-07-14 06:33:17,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108773905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:17,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:17,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:33:17,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633430284] [2022-07-14 06:33:17,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:17,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:33:17,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:33:17,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:33:17,900 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:33:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:18,166 INFO L93 Difference]: Finished difference Result 144 states and 159 transitions. [2022-07-14 06:33:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:33:18,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-14 06:33:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:18,167 INFO L225 Difference]: With dead ends: 144 [2022-07-14 06:33:18,167 INFO L226 Difference]: Without dead ends: 144 [2022-07-14 06:33:18,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:33:18,168 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:18,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 288 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:33:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-14 06:33:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 119. [2022-07-14 06:33:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 104 states have internal predecessors, (122), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2022-07-14 06:33:18,172 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 40 [2022-07-14 06:33:18,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:18,172 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2022-07-14 06:33:18,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:33:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2022-07-14 06:33:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:33:18,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:18,172 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:18,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:18,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:18,373 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2000580541, now seen corresponding path program 1 times [2022-07-14 06:33:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:18,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493828554] [2022-07-14 06:33:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:18,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:18,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:18,375 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:18,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-14 06:33:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:18,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 06:33:18,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:18,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:18,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:18,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:18,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:18,702 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:18,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:18,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:18,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:18,828 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:18,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 13 refuted. 4 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:33:21,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:24,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:24,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493828554] [2022-07-14 06:33:24,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493828554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:33:24,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773026598] [2022-07-14 06:33:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:33:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:33:24,149 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:33:24,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-14 06:33:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:24,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-14 06:33:24,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:24,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:24,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:24,470 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:33:24,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:33:24,492 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:24,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:24,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:24,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:24,617 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:24,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 17 refuted. 2 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:33:24,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:28,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773026598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:33:28,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:33:28,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 14 [2022-07-14 06:33:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217504358] [2022-07-14 06:33:28,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:33:28,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:33:28,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:28,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:33:28,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=366, Unknown=2, NotChecked=0, Total=420 [2022-07-14 06:33:28,584 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:33,303 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2022-07-14 06:33:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:33:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-07-14 06:33:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:33,304 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:33:33,304 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 06:33:33,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=87, Invalid=559, Unknown=4, NotChecked=0, Total=650 [2022-07-14 06:33:33,305 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 115 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:33,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 641 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 387 Invalid, 0 Unknown, 41 Unchecked, 0.5s Time] [2022-07-14 06:33:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 06:33:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2022-07-14 06:33:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 104 states have internal predecessors, (121), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2022-07-14 06:33:33,307 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 40 [2022-07-14 06:33:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:33,308 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2022-07-14 06:33:33,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2022-07-14 06:33:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:33:33,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:33,308 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:33,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-14 06:33:33,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-07-14 06:33:33,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:33:33,725 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:33,725 INFO L85 PathProgramCache]: Analyzing trace with hash -599580005, now seen corresponding path program 1 times [2022-07-14 06:33:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:33,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428725633] [2022-07-14 06:33:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:33,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:33,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:33,726 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:33,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-14 06:33:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:33,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:33:33,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:33,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:33,901 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:33:33,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 06:33:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:33:33,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:33,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:33,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428725633] [2022-07-14 06:33:33,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428725633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:33,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:33,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:33:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385736144] [2022-07-14 06:33:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:33,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:33:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:33:33,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:33:33,937 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:33:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:34,117 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-07-14 06:33:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:33:34,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-14 06:33:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:34,119 INFO L225 Difference]: With dead ends: 139 [2022-07-14 06:33:34,119 INFO L226 Difference]: Without dead ends: 139 [2022-07-14 06:33:34,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:33:34,123 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 48 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:34,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 279 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-07-14 06:33:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-14 06:33:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2022-07-14 06:33:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 103 states have internal predecessors, (120), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2022-07-14 06:33:34,130 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 41 [2022-07-14 06:33:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:34,131 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2022-07-14 06:33:34,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:33:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2022-07-14 06:33:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:33:34,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:34,131 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:34,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:34,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:34,332 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash -599580004, now seen corresponding path program 1 times [2022-07-14 06:33:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:34,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866525700] [2022-07-14 06:33:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:34,334 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:34,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-14 06:33:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:34,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 06:33:34,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:34,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:34,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:34,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:34,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:34,625 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:34,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:34,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:34,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:34,746 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:34,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:34,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:34,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:34,941 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:34,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:33:35,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:37,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866525700] [2022-07-14 06:33:37,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866525700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:33:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1646106172] [2022-07-14 06:33:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:37,959 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:33:37,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:33:37,960 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:33:37,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-07-14 06:33:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:38,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-14 06:33:38,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:38,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:38,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:38,275 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:38,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:38,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:40,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:40,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:40,428 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:40,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:40,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:40,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-14 06:33:40,573 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:33:40,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:33:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:33:40,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:42,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1646106172] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:33:42,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:33:42,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 14 [2022-07-14 06:33:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653870151] [2022-07-14 06:33:42,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:33:42,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:33:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:33:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=297, Unknown=1, NotChecked=0, Total=342 [2022-07-14 06:33:42,959 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:47,823 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2022-07-14 06:33:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:33:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-07-14 06:33:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:47,828 INFO L225 Difference]: With dead ends: 157 [2022-07-14 06:33:47,828 INFO L226 Difference]: Without dead ends: 157 [2022-07-14 06:33:47,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=80, Invalid=517, Unknown=3, NotChecked=0, Total=600 [2022-07-14 06:33:47,833 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 171 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:47,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 606 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 439 Invalid, 0 Unknown, 87 Unchecked, 0.6s Time] [2022-07-14 06:33:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-14 06:33:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 117. [2022-07-14 06:33:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 87 states have (on average 1.367816091954023) internal successors, (119), 102 states have internal predecessors, (119), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2022-07-14 06:33:47,835 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 41 [2022-07-14 06:33:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:47,835 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2022-07-14 06:33:47,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2022-07-14 06:33:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:33:47,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:47,836 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:47,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:48,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:48,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:33:48,237 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash -359356304, now seen corresponding path program 1 times [2022-07-14 06:33:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:48,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398836731] [2022-07-14 06:33:48,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:48,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:48,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:48,238 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:48,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-14 06:33:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:48,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:33:48,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:48,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:48,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:48,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398836731] [2022-07-14 06:33:48,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398836731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:48,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:48,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:33:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826729647] [2022-07-14 06:33:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:48,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:33:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:48,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:33:48,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:48,368 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:48,411 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2022-07-14 06:33:48,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:33:48,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-07-14 06:33:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:48,412 INFO L225 Difference]: With dead ends: 116 [2022-07-14 06:33:48,412 INFO L226 Difference]: Without dead ends: 116 [2022-07-14 06:33:48,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:48,412 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:48,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:33:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-14 06:33:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-14 06:33:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 101 states have internal predecessors, (117), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2022-07-14 06:33:48,414 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 45 [2022-07-14 06:33:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:48,415 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2022-07-14 06:33:48,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2022-07-14 06:33:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:33:48,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:48,415 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:48,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:48,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:48,623 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:48,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1744856553, now seen corresponding path program 1 times [2022-07-14 06:33:48,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:48,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367937654] [2022-07-14 06:33:48,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:48,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:48,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:48,624 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:48,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-14 06:33:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:48,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:33:48,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:33:49,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:49,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:49,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367937654] [2022-07-14 06:33:49,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367937654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:49,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:49,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:33:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371220412] [2022-07-14 06:33:49,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:49,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:33:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:33:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:33:49,061 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:49,065 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-07-14 06:33:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:33:49,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-07-14 06:33:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:49,066 INFO L225 Difference]: With dead ends: 116 [2022-07-14 06:33:49,066 INFO L226 Difference]: Without dead ends: 116 [2022-07-14 06:33:49,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:33:49,067 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 20 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:49,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 302 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2022-07-14 06:33:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-14 06:33:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-14 06:33:49,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 101 states have internal predecessors, (116), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:49,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2022-07-14 06:33:49,069 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 46 [2022-07-14 06:33:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:49,069 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2022-07-14 06:33:49,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2022-07-14 06:33:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:33:49,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:49,070 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:49,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:49,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:49,278 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -599225383, now seen corresponding path program 1 times [2022-07-14 06:33:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645115405] [2022-07-14 06:33:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:49,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:49,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:49,294 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:49,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-14 06:33:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:49,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:33:49,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:33:49,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:49,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645115405] [2022-07-14 06:33:49,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645115405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:49,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:49,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:33:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996932132] [2022-07-14 06:33:49,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:49,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:33:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:49,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:33:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:33:49,475 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:49,777 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2022-07-14 06:33:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:33:49,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-07-14 06:33:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:49,778 INFO L225 Difference]: With dead ends: 171 [2022-07-14 06:33:49,778 INFO L226 Difference]: Without dead ends: 171 [2022-07-14 06:33:49,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:33:49,779 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 118 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:49,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 322 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 119 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2022-07-14 06:33:49,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-14 06:33:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 123. [2022-07-14 06:33:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 107 states have internal predecessors, (123), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 138 transitions. [2022-07-14 06:33:49,782 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 138 transitions. Word has length 46 [2022-07-14 06:33:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:49,782 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 138 transitions. [2022-07-14 06:33:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 138 transitions. [2022-07-14 06:33:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:33:49,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:49,783 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:49,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:49,990 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -599225382, now seen corresponding path program 1 times [2022-07-14 06:33:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:49,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449762415] [2022-07-14 06:33:49,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:49,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:49,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:49,992 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:49,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-14 06:33:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:50,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:33:50,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:33:50,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:50,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:33:50,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-14 06:33:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:51,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:51,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449762415] [2022-07-14 06:33:51,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449762415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:33:51,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:33:51,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-14 06:33:51,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676032113] [2022-07-14 06:33:51,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:33:51,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 06:33:51,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 06:33:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:33:51,416 INFO L87 Difference]: Start difference. First operand 123 states and 138 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-14 06:33:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:52,294 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2022-07-14 06:33:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:33:52,295 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 46 [2022-07-14 06:33:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:52,296 INFO L225 Difference]: With dead ends: 121 [2022-07-14 06:33:52,296 INFO L226 Difference]: Without dead ends: 121 [2022-07-14 06:33:52,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:33:52,297 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 165 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:52,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 622 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:33:52,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-14 06:33:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2022-07-14 06:33:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.2) internal successors, (90), 87 states have internal predecessors, (90), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-14 06:33:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2022-07-14 06:33:52,300 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 46 [2022-07-14 06:33:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:52,300 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2022-07-14 06:33:52,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 6 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-14 06:33:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2022-07-14 06:33:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:33:52,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:52,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:52,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:52,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:52,521 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1239297928, now seen corresponding path program 1 times [2022-07-14 06:33:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:52,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400480453] [2022-07-14 06:33:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:52,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:52,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:52,541 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:52,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-14 06:33:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:52,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:33:52,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:52,727 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:52,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:52,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400480453] [2022-07-14 06:33:52,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400480453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:52,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:52,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:33:52,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860454180] [2022-07-14 06:33:52,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:52,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:33:52,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:33:52,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:52,734 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:52,769 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-07-14 06:33:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:33:52,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-07-14 06:33:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:52,770 INFO L225 Difference]: With dead ends: 122 [2022-07-14 06:33:52,771 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 06:33:52,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:52,771 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:52,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:33:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 06:33:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2022-07-14 06:33:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 79 states have internal predecessors, (81), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-07-14 06:33:52,774 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 46 [2022-07-14 06:33:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:52,774 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-07-14 06:33:52,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-07-14 06:33:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:33:52,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:52,775 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:52,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-07-14 06:33:52,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:52,985 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1744021614, now seen corresponding path program 1 times [2022-07-14 06:33:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:52,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985268228] [2022-07-14 06:33:52,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:52,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:52,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:52,988 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:52,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-14 06:33:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:53,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:33:53,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:53,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:33:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:53,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:53,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985268228] [2022-07-14 06:33:53,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985268228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:53,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:53,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:33:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615987600] [2022-07-14 06:33:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:53,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:33:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:53,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:33:53,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:33:53,172 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:53,267 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-07-14 06:33:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:33:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2022-07-14 06:33:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:53,268 INFO L225 Difference]: With dead ends: 92 [2022-07-14 06:33:53,268 INFO L226 Difference]: Without dead ends: 92 [2022-07-14 06:33:53,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:33:53,269 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:53,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 172 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-07-14 06:33:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-14 06:33:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-14 06:33:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 78 states have internal predecessors, (80), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-07-14 06:33:53,271 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 47 [2022-07-14 06:33:53,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:53,271 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-07-14 06:33:53,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:53,272 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-07-14 06:33:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:33:53,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:53,272 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:53,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:53,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:53,479 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash -967522539, now seen corresponding path program 1 times [2022-07-14 06:33:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:53,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503906068] [2022-07-14 06:33:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:53,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:53,481 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:53,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-14 06:33:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:53,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 06:33:53,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:53,779 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:33:53,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-14 06:33:54,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-14 06:33:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:33:54,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:33:54,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:54,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503906068] [2022-07-14 06:33:54,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503906068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:33:54,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:33:54,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:33:54,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816319157] [2022-07-14 06:33:54,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:54,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:33:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:54,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:33:54,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:33:54,050 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:54,437 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2022-07-14 06:33:54,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:33:54,438 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-07-14 06:33:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:54,438 INFO L225 Difference]: With dead ends: 115 [2022-07-14 06:33:54,439 INFO L226 Difference]: Without dead ends: 115 [2022-07-14 06:33:54,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:33:54,439 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 142 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:54,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 399 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 197 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2022-07-14 06:33:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-14 06:33:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2022-07-14 06:33:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 75 states have internal predecessors, (77), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-07-14 06:33:54,441 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 49 [2022-07-14 06:33:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:54,441 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-07-14 06:33:54,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:33:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-07-14 06:33:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:33:54,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:54,442 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:54,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Ended with exit code 0 [2022-07-14 06:33:54,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:54,650 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 921264785, now seen corresponding path program 1 times [2022-07-14 06:33:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:54,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946625662] [2022-07-14 06:33:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:54,652 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:54,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-14 06:33:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:54,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-14 06:33:54,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:54,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:33:54,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:33:55,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:33:55,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:33:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:55,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:55,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-07-14 06:33:55,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:55,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:55,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-14 06:33:55,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:55,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:33:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 06:33:55,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:55,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946625662] [2022-07-14 06:33:55,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946625662] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:33:55,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:33:55,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 19 [2022-07-14 06:33:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183836838] [2022-07-14 06:33:55,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:55,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:33:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:33:55,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:33:55,919 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:56,672 INFO L93 Difference]: Finished difference Result 133 states and 132 transitions. [2022-07-14 06:33:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:33:56,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-14 06:33:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:56,673 INFO L225 Difference]: With dead ends: 133 [2022-07-14 06:33:56,673 INFO L226 Difference]: Without dead ends: 133 [2022-07-14 06:33:56,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:33:56,673 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 204 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:56,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 521 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:33:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-14 06:33:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2022-07-14 06:33:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 81 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-14 06:33:56,675 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 51 [2022-07-14 06:33:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:56,676 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-14 06:33:56,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-14 06:33:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:33:56,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:56,676 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:56,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:56,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:56,884 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554682, now seen corresponding path program 1 times [2022-07-14 06:33:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64365064] [2022-07-14 06:33:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:56,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:56,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:56,885 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:56,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-14 06:33:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:57,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:33:57,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:57,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:57,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:57,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64365064] [2022-07-14 06:33:57,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64365064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:33:57,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:33:57,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-07-14 06:33:57,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114267250] [2022-07-14 06:33:57,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:33:57,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:33:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:33:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:57,161 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:57,199 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-14 06:33:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:33:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-07-14 06:33:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:57,200 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:33:57,200 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:33:57,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:33:57,201 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 28 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:57,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 221 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:33:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:33:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-14 06:33:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 80 states have internal predecessors, (82), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-07-14 06:33:57,203 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 52 [2022-07-14 06:33:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:57,203 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-07-14 06:33:57,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-14 06:33:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-07-14 06:33:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:33:57,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:57,204 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:57,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Ended with exit code 0 [2022-07-14 06:33:57,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:57,411 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 572445235, now seen corresponding path program 1 times [2022-07-14 06:33:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:57,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971289901] [2022-07-14 06:33:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:57,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:57,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:57,413 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:57,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-07-14 06:33:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:57,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:33:57,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 06:33:58,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:58,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:58,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971289901] [2022-07-14 06:33:58,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971289901] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:33:58,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:33:58,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-07-14 06:33:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788207820] [2022-07-14 06:33:58,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:33:58,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:33:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:33:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:33:58,163 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-14 06:33:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:33:58,183 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-07-14 06:33:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:33:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 53 [2022-07-14 06:33:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:33:58,184 INFO L225 Difference]: With dead ends: 97 [2022-07-14 06:33:58,184 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 06:33:58,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:33:58,185 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 47 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:33:58,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 333 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 73 Unchecked, 0.0s Time] [2022-07-14 06:33:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 06:33:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-14 06:33:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 83 states have internal predecessors, (85), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:33:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-07-14 06:33:58,186 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 53 [2022-07-14 06:33:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:33:58,186 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-07-14 06:33:58,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-14 06:33:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-07-14 06:33:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:33:58,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:33:58,187 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:33:58,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-07-14 06:33:58,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:33:58,388 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:33:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:33:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash -928199467, now seen corresponding path program 1 times [2022-07-14 06:33:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:33:58,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093051321] [2022-07-14 06:33:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:33:58,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:33:58,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:33:58,389 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:33:58,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-07-14 06:33:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:33:58,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 06:33:58,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:33:58,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:33:58,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:33:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 06:33:58,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:33:59,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-14 06:33:59,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-14 06:33:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:33:59,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:33:59,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093051321] [2022-07-14 06:33:59,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093051321] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:33:59,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:33:59,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 22 [2022-07-14 06:33:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414538845] [2022-07-14 06:33:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:33:59,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:33:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:33:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:33:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:33:59,529 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:34:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:34:00,413 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-07-14 06:34:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:34:00,414 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2022-07-14 06:34:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:34:00,414 INFO L225 Difference]: With dead ends: 96 [2022-07-14 06:34:00,415 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 06:34:00,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:34:00,415 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 168 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:34:00,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 460 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:34:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 06:34:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-14 06:34:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.12) internal successors, (84), 82 states have internal predecessors, (84), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:34:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-07-14 06:34:00,417 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 54 [2022-07-14 06:34:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:34:00,417 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-07-14 06:34:00,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:34:00,417 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-07-14 06:34:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:34:00,418 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:34:00,418 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:34:00,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-07-14 06:34:00,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:34:00,626 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:34:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:34:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 565933224, now seen corresponding path program 1 times [2022-07-14 06:34:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:34:00,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424566008] [2022-07-14 06:34:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:34:00,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:34:00,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:34:00,628 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:34:00,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-07-14 06:34:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:34:00,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:34:00,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:34:00,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:34:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:34:00,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:34:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:34:00,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:34:00,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424566008] [2022-07-14 06:34:00,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424566008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:34:00,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:34:00,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-07-14 06:34:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233836330] [2022-07-14 06:34:00,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:34:00,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:34:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:34:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:34:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:34:00,991 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 06:34:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:34:01,091 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-07-14 06:34:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:34:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2022-07-14 06:34:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:34:01,092 INFO L225 Difference]: With dead ends: 97 [2022-07-14 06:34:01,092 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 06:34:01,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:34:01,092 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:34:01,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 203 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-07-14 06:34:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 06:34:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-14 06:34:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.118421052631579) internal successors, (85), 83 states have internal predecessors, (85), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:34:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-07-14 06:34:01,094 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 54 [2022-07-14 06:34:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:34:01,094 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-07-14 06:34:01,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-14 06:34:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-07-14 06:34:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 06:34:01,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:34:01,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:34:01,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-07-14 06:34:01,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:34:01,295 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:34:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:34:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1290587706, now seen corresponding path program 1 times [2022-07-14 06:34:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:34:01,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329259010] [2022-07-14 06:34:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:34:01,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:34:01,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:34:01,297 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:34:01,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-07-14 06:34:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:34:01,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-14 06:34:01,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:34:02,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:34:02,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:34:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:34:02,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:34:03,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-14 06:34:03,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-07-14 06:34:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-14 06:34:04,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:34:04,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329259010] [2022-07-14 06:34:04,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329259010] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:34:04,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:34:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [18] total 31 [2022-07-14 06:34:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042159705] [2022-07-14 06:34:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:34:04,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:34:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:34:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:34:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:34:04,264 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:34:06,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 06:34:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:34:07,614 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2022-07-14 06:34:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:34:07,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 55 [2022-07-14 06:34:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:34:07,615 INFO L225 Difference]: With dead ends: 108 [2022-07-14 06:34:07,615 INFO L226 Difference]: Without dead ends: 108 [2022-07-14 06:34:07,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 06:34:07,616 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 199 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:34:07,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 465 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 302 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-07-14 06:34:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-14 06:34:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2022-07-14 06:34:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.105263157894737) internal successors, (84), 82 states have internal predecessors, (84), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:34:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-07-14 06:34:07,618 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 55 [2022-07-14 06:34:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:34:07,619 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-07-14 06:34:07,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:34:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-07-14 06:34:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:34:07,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:34:07,619 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:34:07,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2022-07-14 06:34:07,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:34:07,827 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:34:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:34:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1353759607, now seen corresponding path program 1 times [2022-07-14 06:34:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:34:07,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517987592] [2022-07-14 06:34:07,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:34:07,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:34:07,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:34:07,828 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:34:07,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-07-14 06:34:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:34:07,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 06:34:07,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:34:08,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:34:08,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 06:34:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-14 06:34:08,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:34:08,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-14 06:34:08,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2022-07-14 06:34:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 06:34:09,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:34:09,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517987592] [2022-07-14 06:34:09,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517987592] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:34:09,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:34:09,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 24 [2022-07-14 06:34:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152418174] [2022-07-14 06:34:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:34:09,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:34:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:34:09,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:34:09,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:34:09,140 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:34:09,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:34:09,907 INFO L93 Difference]: Finished difference Result 108 states and 107 transitions. [2022-07-14 06:34:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:34:09,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2022-07-14 06:34:09,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:34:09,908 INFO L225 Difference]: With dead ends: 108 [2022-07-14 06:34:09,908 INFO L226 Difference]: Without dead ends: 108 [2022-07-14 06:34:09,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2022-07-14 06:34:09,909 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 178 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:34:09,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 616 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:34:09,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-14 06:34:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2022-07-14 06:34:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 82 states have internal predecessors, (83), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-14 06:34:09,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2022-07-14 06:34:09,911 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 56 [2022-07-14 06:34:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:34:09,911 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2022-07-14 06:34:09,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 06:34:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2022-07-14 06:34:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:34:09,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:34:09,912 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:34:09,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2022-07-14 06:34:10,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:34:10,120 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-07-14 06:34:10,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:34:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1353513335, now seen corresponding path program 1 times [2022-07-14 06:34:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:34:10,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271754787] [2022-07-14 06:34:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:34:10,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:34:10,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:34:10,122 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:34:10,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-07-14 06:34:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:34:10,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 06:34:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 06:34:10,448 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-14 06:34:10,449 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 06:34:10,449 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (29 of 30 remaining) [2022-07-14 06:34:10,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2022-07-14 06:34:10,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2022-07-14 06:34:10,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2022-07-14 06:34:10,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2022-07-14 06:34:10,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2022-07-14 06:34:10,451 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (18 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (17 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (16 of 30 remaining) [2022-07-14 06:34:10,452 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (13 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (12 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (11 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (10 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (9 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (8 of 30 remaining) [2022-07-14 06:34:10,453 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (7 of 30 remaining) [2022-07-14 06:34:10,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (6 of 30 remaining) [2022-07-14 06:34:10,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (5 of 30 remaining) [2022-07-14 06:34:10,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (4 of 30 remaining) [2022-07-14 06:34:10,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE (3 of 30 remaining) [2022-07-14 06:34:10,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (2 of 30 remaining) [2022-07-14 06:34:10,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_i2c_set_clientdataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2022-07-14 06:34:10,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_i2c_set_clientdataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 30 remaining) [2022-07-14 06:34:10,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-07-14 06:34:10,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:34:10,665 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:34:10,668 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 06:34:10,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 06:34:10 BoogieIcfgContainer [2022-07-14 06:34:10,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 06:34:10,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 06:34:10,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 06:34:10,709 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 06:34:10,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:30:18" (3/4) ... [2022-07-14 06:34:10,710 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 06:34:10,746 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 06:34:10,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 06:34:10,747 INFO L158 Benchmark]: Toolchain (without parser) took 232955.31ms. Allocated memory was 56.6MB in the beginning and 94.4MB in the end (delta: 37.7MB). Free memory was 32.7MB in the beginning and 24.2MB in the end (delta: 8.5MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-07-14 06:34:10,747 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:34:10,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.16ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 32.5MB in the beginning and 42.4MB in the end (delta: -9.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-14 06:34:10,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.86ms. Allocated memory is still 77.6MB. Free memory was 42.4MB in the beginning and 39.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:34:10,748 INFO L158 Benchmark]: Boogie Preprocessor took 44.50ms. Allocated memory is still 77.6MB. Free memory was 39.8MB in the beginning and 38.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:34:10,748 INFO L158 Benchmark]: RCFGBuilder took 412.56ms. Allocated memory is still 77.6MB. Free memory was 38.0MB in the beginning and 45.1MB in the end (delta: -7.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-14 06:34:10,748 INFO L158 Benchmark]: TraceAbstraction took 231884.21ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.4MB in the beginning and 29.3MB in the end (delta: 15.1MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2022-07-14 06:34:10,748 INFO L158 Benchmark]: Witness Printer took 38.44ms. Allocated memory is still 94.4MB. Free memory was 29.3MB in the beginning and 24.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 06:34:10,748 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.15ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.16ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 32.5MB in the beginning and 42.4MB in the end (delta: -9.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.86ms. Allocated memory is still 77.6MB. Free memory was 42.4MB in the beginning and 39.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.50ms. Allocated memory is still 77.6MB. Free memory was 39.8MB in the beginning and 38.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.56ms. Allocated memory is still 77.6MB. Free memory was 38.0MB in the beginning and 45.1MB in the end (delta: -7.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * TraceAbstraction took 231884.21ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.4MB in the beginning and 29.3MB in the end (delta: 15.1MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Witness Printer took 38.44ms. Allocated memory is still 94.4MB. Free memory was 29.3MB in the beginning and 24.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 799]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L824] CALL entry_point() [L803] CALL, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [\old(size)=20, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L803] RET, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct ldv_i2c_client))={10:0}] [L803] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L804] COND FALSE !(!c11) VAL [c11={10:0}, ldv_global_msg_list={1:0}] [L806] CALL, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [\old(size)=4, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L806] RET, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [c11={10:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct ldv_m88ts2022_config))={5:0}] [L805-L806] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L807] COND FALSE !(!cfg) VAL [c11={10:0}, cfg={5:0}, ldv_global_msg_list={1:0}] [L808] c11->dev.platform_data = cfg VAL [c11={10:0}, cfg={5:0}, ldv_global_msg_list={1:0}] [L810] CALL, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [\old(size)=4, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L810] RET, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [c11={10:0}, cfg={5:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct ldv_dvb_frontend))={2:0}] [L809-L810] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L811] COND FALSE !(!fe) VAL [c11={10:0}, cfg={5:0}, fe={2:0}, ldv_global_msg_list={1:0}] [L812] cfg->fe = fe VAL [c11={10:0}, cfg={5:0}, fe={2:0}, ldv_global_msg_list={1:0}] [L813] CALL alloc_2_11(c11) [L784] EXPR client->dev.platform_data VAL [client={10:0}, client={10:0}, client->dev.platform_data={5:0}, ldv_global_msg_list={1:0}] [L784] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L785] EXPR cfg->fe VAL [cfg={5:0}, cfg->fe={2:0}, client={10:0}, client={10:0}, ldv_global_msg_list={1:0}] [L785] struct ldv_dvb_frontend *fe = cfg->fe; [L786] CALL, EXPR ldv_malloc(sizeof(struct Data11)) VAL [\old(size)=12, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L786] RET, EXPR ldv_malloc(sizeof(struct Data11)) VAL [cfg={5:0}, client={10:0}, client={10:0}, fe={2:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct Data11))={3:0}] [L786] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L787] COND FALSE !(!priv) VAL [cfg={5:0}, client={10:0}, client={10:0}, fe={2:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L788] fe->tuner_priv = priv VAL [cfg={5:0}, client={10:0}, client={10:0}, fe={2:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L789] CALL ldv_i2c_set_clientdata(client, priv) VAL [ldv_global_msg_list={1:0}] [L778] CALL ldv_dev_set_drvdata(&dev->dev, data) [L623] dev->driver_data = data VAL [data={3:0}, data={3:0}, dev={10:0}, dev={10:0}, ldv_global_msg_list={1:0}] [L778] RET ldv_dev_set_drvdata(&dev->dev, data) [L789] RET ldv_i2c_set_clientdata(client, priv) VAL [cfg={5:0}, client={10:0}, client={10:0}, fe={2:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L790] free(priv) VAL [cfg={5:0}, client={10:0}, client={10:0}, fe={2:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L790] free(priv) VAL [cfg={5:0}, client={10:0}, client={10:0}, fe={2:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L790] free(priv) [L791] return 0; VAL [\result=0, cfg={5:0}, client={10:0}, client={10:0}, fe={2:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L813] RET alloc_2_11(c11) [L814] CALL free_11(c11) [L797] CALL, EXPR ldv_i2c_get_clientdata(client) [L774] CALL, EXPR ldv_dev_get_drvdata(&dev->dev) [L619] EXPR dev->driver_data VAL [dev={10:0}, dev={10:0}, dev->driver_data={3:0}, ldv_global_msg_list={1:0}] [L619] return dev->driver_data; [L774] RET, EXPR ldv_dev_get_drvdata(&dev->dev) [L774] return ldv_dev_get_drvdata(&dev->dev); [L797] RET, EXPR ldv_i2c_get_clientdata(client) [L797] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L798] COND TRUE \read(*priv) VAL [client={10:0}, client={10:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L799] free(priv) VAL [client={10:0}, client={10:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L799] free(priv) VAL [client={10:0}, client={10:0}, ldv_global_msg_list={1:0}, priv={3:0}] [L799] free(priv) VAL [client={10:0}, client={10:0}, ldv_global_msg_list={1:0}, priv={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 231.8s, OverallIterations: 41, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 65.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3266 SdHoareTripleChecker+Valid, 15.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3199 mSDsluCounter, 20655 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2996 IncrementalHoareTripleChecker+Unchecked, 17309 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9211 IncrementalHoareTripleChecker+Invalid, 12547 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 3346 mSDtfsCounter, 9211 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2548 GetRequests, 1888 SyntacticMatches, 56 SemanticMatches, 604 ConstructedPredicates, 10 IntricatePredicates, 7 DeprecatedPredicates, 3669 ImplicationChecksByTransitivity, 184.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=10, InterpolantAutomatonStates: 384, 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, 40 MinimizatonAttempts, 1042 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 150.5s InterpolantComputationTime, 1809 NumberOfCodeBlocks, 1809 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2197 ConstructedInterpolants, 349 QuantifiedInterpolants, 14746 SizeOfPredicates, 385 NumberOfNonLiveVariables, 6944 ConjunctsInSsa, 1079 ConjunctsInUnsatCore, 63 InterpolantComputations, 21 PerfectInterpolantSequences, 820/1060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-14 06:34:10,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)