./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/memsafety-ext2/optional_data_creation_test04-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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:53:23,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:53:23,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:53:23,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:53:23,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:53:23,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:53:23,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:53:23,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:53:23,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:53:23,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:53:23,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:53:23,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:53:23,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:53:23,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:53:23,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:53:23,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:53:23,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:53:23,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:53:23,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:53:23,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:53:23,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:53:23,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:53:23,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:53:23,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:53:23,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:53:23,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:53:23,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:53:23,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:53:23,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:53:23,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:53:23,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:53:23,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:53:23,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:53:23,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:53:23,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:53:23,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:53:23,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:53:23,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:53:23,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:53:23,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:53:23,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:53:23,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 05:53:23,806 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:53:23,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:53:23,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:53:23,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:53:23,811 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:53:23,811 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:53:23,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:53:23,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:53:23,812 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:53:23,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:53:23,813 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:53:23,813 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:53:23,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:53:23,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:53:23,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:53:23,814 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:53:23,814 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:53:23,814 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:53:23,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:53:23,814 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:53:23,815 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:53:23,815 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:53:23,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:53:23,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:53:23,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:53:23,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:53:23,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:53:23,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:53:23,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:53:23,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:53:23,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:53:23,817 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2021-12-16 05:53:24,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:53:24,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:53:24,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:53:24,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:53:24,062 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:53:24,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2021-12-16 05:53:24,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0bf9eb5/4b2843c8a00145c39f8ca64a06e63734/FLAGce6bc20e7 [2021-12-16 05:53:24,515 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:53:24,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2021-12-16 05:53:24,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0bf9eb5/4b2843c8a00145c39f8ca64a06e63734/FLAGce6bc20e7 [2021-12-16 05:53:24,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0bf9eb5/4b2843c8a00145c39f8ca64a06e63734 [2021-12-16 05:53:24,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:53:24,911 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:53:24,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:53:24,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:53:24,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:53:24,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:53:24" (1/1) ... [2021-12-16 05:53:24,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116b243b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:24, skipping insertion in model container [2021-12-16 05:53:24,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:53:24" (1/1) ... [2021-12-16 05:53:24,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:53:24,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:53:25,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:53:25,195 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-16 05:53:25,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@551bc0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:25, skipping insertion in model container [2021-12-16 05:53:25,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:53:25,197 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-16 05:53:25,199 INFO L158 Benchmark]: Toolchain (without parser) took 286.90ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 77.7MB in the beginning and 119.3MB in the end (delta: -41.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 05:53:25,200 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 64.2MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 05:53:25,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.42ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 77.7MB in the beginning and 119.3MB in the end (delta: -41.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 05:53:25,203 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 64.2MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.42ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 77.7MB in the beginning and 119.3MB in the end (delta: -41.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:53:26,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:53:26,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:53:26,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:53:26,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:53:26,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:53:26,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:53:26,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:53:26,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:53:26,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:53:26,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:53:26,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:53:26,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:53:26,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:53:26,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:53:26,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:53:26,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:53:26,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:53:26,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:53:26,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:53:26,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:53:26,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:53:26,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:53:26,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:53:26,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:53:26,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:53:26,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:53:26,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:53:26,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:53:26,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:53:26,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:53:26,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:53:26,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:53:26,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:53:26,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:53:26,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:53:26,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:53:26,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:53:26,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:53:26,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:53:26,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:53:26,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-16 05:53:26,745 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:53:26,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:53:26,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:53:26,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:53:26,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:53:26,747 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:53:26,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:53:26,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:53:26,749 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:53:26,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:53:26,750 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:53:26,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:53:26,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:53:26,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:53:26,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:53:26,750 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:53:26,751 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:53:26,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:53:26,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:53:26,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:53:26,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:53:26,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:53:26,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:53:26,753 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 05:53:26,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 05:53:26,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:53:26,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 05:53:26,753 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2021-12-16 05:53:27,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:53:27,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:53:27,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:53:27,035 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:53:27,036 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:53:27,037 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2021-12-16 05:53:27,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfafbaaf9/62ef50dcc9eb4026b0b2180dcf31ba3d/FLAG5fa813e9e [2021-12-16 05:53:27,493 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:53:27,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2021-12-16 05:53:27,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfafbaaf9/62ef50dcc9eb4026b0b2180dcf31ba3d/FLAG5fa813e9e [2021-12-16 05:53:27,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfafbaaf9/62ef50dcc9eb4026b0b2180dcf31ba3d [2021-12-16 05:53:27,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:53:27,867 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:53:27,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:53:27,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:53:27,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:53:27,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:53:27" (1/1) ... [2021-12-16 05:53:27,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59676c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:27, skipping insertion in model container [2021-12-16 05:53:27,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:53:27" (1/1) ... [2021-12-16 05:53:27,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:53:27,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:53:28,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:53:28,152 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-16 05:53:28,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:53:28,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:53:28,177 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:53:28,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:53:28,238 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:53:28,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28 WrapperNode [2021-12-16 05:53:28,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:53:28,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:53:28,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:53:28,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:53:28,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,284 INFO L137 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2021-12-16 05:53:28,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:53:28,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:53:28,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:53:28,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:53:28,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:53:28,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:53:28,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:53:28,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:53:28,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (1/1) ... [2021-12-16 05:53:28,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:53:28,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:53:28,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-16 05:53:28,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-16 05:53:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 05:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:53:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 05:53:28,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-16 05:53:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 05:53:28,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:53:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:53:28,494 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:53:28,496 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:53:28,930 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:53:28,935 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:53:28,935 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-16 05:53:28,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:53:28 BoogieIcfgContainer [2021-12-16 05:53:28,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:53:28,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:53:28,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:53:28,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:53:28,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:53:27" (1/3) ... [2021-12-16 05:53:28,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54327a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:53:28, skipping insertion in model container [2021-12-16 05:53:28,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:53:28" (2/3) ... [2021-12-16 05:53:28,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54327a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:53:28, skipping insertion in model container [2021-12-16 05:53:28,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:53:28" (3/3) ... [2021-12-16 05:53:28,942 INFO L111 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2021-12-16 05:53:28,946 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:53:28,946 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2021-12-16 05:53:28,973 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:53:28,977 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 05:53:28,979 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-12-16 05:53:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-16 05:53:28,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:28,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-16 05:53:28,994 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:28,998 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2021-12-16 05:53:29,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:29,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139625338] [2021-12-16 05:53:29,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:29,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:29,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:29,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:29,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-16 05:53:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:29,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 05:53:29,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:29,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:29,210 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-16 05:53:29,211 INFO L388 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 [2021-12-16 05:53:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:29,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:29,231 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:29,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139625338] [2021-12-16 05:53:29,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139625338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:29,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:29,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:53:29,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714472502] [2021-12-16 05:53:29,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:29,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:53:29,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:29,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:53:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:53:29,273 INFO L87 Difference]: Start difference. First operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:29,547 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-12-16 05:53:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:53:29,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-16 05:53:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:29,556 INFO L225 Difference]: With dead ends: 148 [2021-12-16 05:53:29,557 INFO L226 Difference]: Without dead ends: 146 [2021-12-16 05:53:29,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:29,562 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:29,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:29,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-16 05:53:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2021-12-16 05:53:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:29,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-12-16 05:53:29,605 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2021-12-16 05:53:29,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:29,605 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-12-16 05:53:29,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-12-16 05:53:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-16 05:53:29,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:29,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-16 05:53:29,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:29,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:29,812 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2021-12-16 05:53:29,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:29,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850259771] [2021-12-16 05:53:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:29,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:29,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:29,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-16 05:53:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:29,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 05:53:29,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:29,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:29,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:29,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:29,962 INFO L388 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 [2021-12-16 05:53:29,971 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:53:29,972 INFO L388 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 14 treesize of output 14 [2021-12-16 05:53:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:29,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:29,992 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:29,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850259771] [2021-12-16 05:53:29,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850259771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:29,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:29,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:53:29,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886651378] [2021-12-16 05:53:29,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:29,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:53:29,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:29,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:53:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:53:29,999 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:30,383 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2021-12-16 05:53:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:53:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-16 05:53:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:30,384 INFO L225 Difference]: With dead ends: 236 [2021-12-16 05:53:30,384 INFO L226 Difference]: Without dead ends: 236 [2021-12-16 05:53:30,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:30,385 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 235 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:30,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 97 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 05:53:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-16 05:53:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2021-12-16 05:53:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2021-12-16 05:53:30,391 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2021-12-16 05:53:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:30,392 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2021-12-16 05:53:30,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2021-12-16 05:53:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:53:30,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:30,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:53:30,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:30,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:30,614 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:30,615 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2021-12-16 05:53:30,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:30,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571923563] [2021-12-16 05:53:30,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:30,615 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:30,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:30,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:30,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-16 05:53:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:30,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:53:30,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:30,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:30,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:30,672 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:30,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571923563] [2021-12-16 05:53:30,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571923563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:30,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:30,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:53:30,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989908793] [2021-12-16 05:53:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:30,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:53:30,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:53:30,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:53:30,674 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:30,828 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2021-12-16 05:53:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:53:30,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-16 05:53:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:30,829 INFO L225 Difference]: With dead ends: 136 [2021-12-16 05:53:30,829 INFO L226 Difference]: Without dead ends: 136 [2021-12-16 05:53:30,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:53:30,830 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:30,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 87 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:53:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-16 05:53:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2021-12-16 05:53:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-12-16 05:53:30,835 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2021-12-16 05:53:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:30,835 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-12-16 05:53:30,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-12-16 05:53:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:53:30,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:30,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:53:30,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:31,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:31,042 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:31,043 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2021-12-16 05:53:31,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:31,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007306093] [2021-12-16 05:53:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:31,044 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:31,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:31,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-16 05:53:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:31,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 05:53:31,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:31,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:31,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:31,115 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:31,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007306093] [2021-12-16 05:53:31,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007306093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:31,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:31,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:53:31,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930963356] [2021-12-16 05:53:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:31,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:53:31,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:53:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:53:31,117 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:31,343 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2021-12-16 05:53:31,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:53:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-16 05:53:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:31,345 INFO L225 Difference]: With dead ends: 180 [2021-12-16 05:53:31,345 INFO L226 Difference]: Without dead ends: 180 [2021-12-16 05:53:31,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:53:31,346 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:31,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-16 05:53:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2021-12-16 05:53:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:31,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2021-12-16 05:53:31,350 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2021-12-16 05:53:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:31,351 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2021-12-16 05:53:31,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2021-12-16 05:53:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-16 05:53:31,351 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:31,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:31,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:31,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:31,558 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:31,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2021-12-16 05:53:31,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:31,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143802819] [2021-12-16 05:53:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:31,559 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:31,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:31,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:31,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-16 05:53:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:31,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 05:53:31,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:31,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:31,653 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-16 05:53:31,653 INFO L388 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 [2021-12-16 05:53:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:31,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:31,661 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:31,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143802819] [2021-12-16 05:53:31,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143802819] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:31,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:31,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:53:31,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439814774] [2021-12-16 05:53:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:31,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:53:31,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:31,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:53:31,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:53:31,663 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:31,812 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2021-12-16 05:53:31,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:53:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-16 05:53:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:31,813 INFO L225 Difference]: With dead ends: 151 [2021-12-16 05:53:31,813 INFO L226 Difference]: Without dead ends: 151 [2021-12-16 05:53:31,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:53:31,814 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 69 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:31,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:53:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-16 05:53:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2021-12-16 05:53:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2021-12-16 05:53:31,818 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2021-12-16 05:53:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:31,818 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2021-12-16 05:53:31,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2021-12-16 05:53:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-16 05:53:31,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:31,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:31,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:32,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:32,020 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2021-12-16 05:53:32,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:32,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203384653] [2021-12-16 05:53:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:32,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:32,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:32,022 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:32,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-16 05:53:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:32,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 05:53:32,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:32,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:32,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:32,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:32,153 INFO L388 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 [2021-12-16 05:53:32,163 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:53:32,163 INFO L388 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 14 treesize of output 14 [2021-12-16 05:53:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:32,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:32,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:32,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203384653] [2021-12-16 05:53:32,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203384653] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:32,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:32,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:53:32,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351091246] [2021-12-16 05:53:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:32,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:53:32,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:53:32,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:53:32,178 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:32,385 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2021-12-16 05:53:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 05:53:32,386 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-16 05:53:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:32,386 INFO L225 Difference]: With dead ends: 200 [2021-12-16 05:53:32,386 INFO L226 Difference]: Without dead ends: 200 [2021-12-16 05:53:32,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:53:32,387 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 183 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:32,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 166 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-16 05:53:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2021-12-16 05:53:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2021-12-16 05:53:32,391 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2021-12-16 05:53:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:32,391 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-12-16 05:53:32,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2021-12-16 05:53:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 05:53:32,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:32,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:32,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:32,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:32,599 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2021-12-16 05:53:32,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:32,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096022344] [2021-12-16 05:53:32,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:32,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:32,601 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:32,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-16 05:53:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:32,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 05:53:32,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:32,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:32,690 INFO L388 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 [2021-12-16 05:53:32,718 INFO L388 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 24 treesize of output 12 [2021-12-16 05:53:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:32,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:32,725 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:32,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096022344] [2021-12-16 05:53:32,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096022344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:32,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:32,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:32,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157699174] [2021-12-16 05:53:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:32,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:32,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:32,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:32,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:32,727 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:32,980 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2021-12-16 05:53:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:53:32,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-16 05:53:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:32,984 INFO L225 Difference]: With dead ends: 109 [2021-12-16 05:53:32,984 INFO L226 Difference]: Without dead ends: 109 [2021-12-16 05:53:32,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:53:32,985 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:32,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 216 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-16 05:53:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2021-12-16 05:53:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:32,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2021-12-16 05:53:32,989 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2021-12-16 05:53:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:32,989 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2021-12-16 05:53:32,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:32,989 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2021-12-16 05:53:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-16 05:53:32,990 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:32,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:33,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:33,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:33,203 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2021-12-16 05:53:33,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:33,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334303791] [2021-12-16 05:53:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:33,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:33,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:33,205 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:33,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-16 05:53:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:33,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 05:53:33,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:33,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:33,312 INFO L388 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 [2021-12-16 05:53:33,319 INFO L388 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 [2021-12-16 05:53:33,377 INFO L388 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 21 treesize of output 9 [2021-12-16 05:53:33,381 INFO L388 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 19 treesize of output 7 [2021-12-16 05:53:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:33,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:33,397 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:33,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334303791] [2021-12-16 05:53:33,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334303791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:33,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:33,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:53:33,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898672952] [2021-12-16 05:53:33,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:33,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:53:33,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:33,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:53:33,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:53:33,399 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:33,646 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2021-12-16 05:53:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:53:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-16 05:53:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:33,647 INFO L225 Difference]: With dead ends: 104 [2021-12-16 05:53:33,647 INFO L226 Difference]: Without dead ends: 104 [2021-12-16 05:53:33,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:53:33,648 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:33,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-16 05:53:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-12-16 05:53:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-12-16 05:53:33,650 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2021-12-16 05:53:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:33,650 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-16 05:53:33,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-12-16 05:53:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-16 05:53:33,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:33,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:33,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:33,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:33,860 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:33,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:33,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2021-12-16 05:53:33,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:33,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951072607] [2021-12-16 05:53:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:33,861 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:33,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:33,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-16 05:53:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:33,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 05:53:33,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:33,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:34,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:53:34,011 INFO L388 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 14 treesize of output 16 [2021-12-16 05:53:34,019 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:53:34,019 INFO L388 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 13 treesize of output 13 [2021-12-16 05:53:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:34,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:34,073 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:34,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951072607] [2021-12-16 05:53:34,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951072607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:34,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:34,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:53:34,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228178177] [2021-12-16 05:53:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:34,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:53:34,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:53:34,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:53:34,074 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:34,258 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2021-12-16 05:53:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:53:34,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-16 05:53:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:34,260 INFO L225 Difference]: With dead ends: 133 [2021-12-16 05:53:34,260 INFO L226 Difference]: Without dead ends: 133 [2021-12-16 05:53:34,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:53:34,260 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 411 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:34,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 65 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-16 05:53:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2021-12-16 05:53:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-12-16 05:53:34,263 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2021-12-16 05:53:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:34,264 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-12-16 05:53:34,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-12-16 05:53:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 05:53:34,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:34,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:34,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:34,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:34,472 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2021-12-16 05:53:34,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:34,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971044243] [2021-12-16 05:53:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:34,473 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:34,474 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:34,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-16 05:53:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:34,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 05:53:34,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:34,643 INFO L388 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 [2021-12-16 05:53:34,658 INFO L388 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 [2021-12-16 05:53:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:34,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:34,667 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971044243] [2021-12-16 05:53:34,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971044243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:34,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:34,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:53:34,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140805465] [2021-12-16 05:53:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:34,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:34,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:34,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:34,669 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:34,843 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2021-12-16 05:53:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:53:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-16 05:53:34,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:34,844 INFO L225 Difference]: With dead ends: 137 [2021-12-16 05:53:34,844 INFO L226 Difference]: Without dead ends: 137 [2021-12-16 05:53:34,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:53:34,845 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 164 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:34,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 174 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:53:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-16 05:53:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2021-12-16 05:53:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-12-16 05:53:34,847 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2021-12-16 05:53:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:34,848 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-12-16 05:53:34,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-12-16 05:53:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 05:53:34,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:34,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:34,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:35,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:35,055 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2021-12-16 05:53:35,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:35,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30895483] [2021-12-16 05:53:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:35,056 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:35,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:35,056 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:35,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-16 05:53:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:35,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 05:53:35,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:35,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:35,214 INFO L388 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 [2021-12-16 05:53:35,242 INFO L388 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 20 treesize of output 12 [2021-12-16 05:53:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:35,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:35,250 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:35,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30895483] [2021-12-16 05:53:35,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30895483] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:35,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:35,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:35,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057583461] [2021-12-16 05:53:35,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:35,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:35,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:35,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:35,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:35,252 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:35,494 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-12-16 05:53:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:53:35,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-16 05:53:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:35,495 INFO L225 Difference]: With dead ends: 129 [2021-12-16 05:53:35,495 INFO L226 Difference]: Without dead ends: 129 [2021-12-16 05:53:35,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:53:35,496 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:35,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:35,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-16 05:53:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2021-12-16 05:53:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2021-12-16 05:53:35,498 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2021-12-16 05:53:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:35,499 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2021-12-16 05:53:35,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2021-12-16 05:53:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-16 05:53:35,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:35,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:35,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:35,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:35,706 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2021-12-16 05:53:35,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:35,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262567036] [2021-12-16 05:53:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:35,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:35,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:35,708 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:35,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-16 05:53:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:35,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 05:53:35,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:35,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:35,877 INFO L388 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 [2021-12-16 05:53:35,881 INFO L388 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 [2021-12-16 05:53:35,921 INFO L388 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 17 treesize of output 9 [2021-12-16 05:53:35,923 INFO L388 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 [2021-12-16 05:53:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:35,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:35,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:35,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262567036] [2021-12-16 05:53:35,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262567036] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:35,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:35,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:35,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182503769] [2021-12-16 05:53:35,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:35,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:35,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:35,938 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:36,305 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2021-12-16 05:53:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:53:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-16 05:53:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:36,307 INFO L225 Difference]: With dead ends: 201 [2021-12-16 05:53:36,307 INFO L226 Difference]: Without dead ends: 201 [2021-12-16 05:53:36,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:53:36,307 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:36,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 221 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:53:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-16 05:53:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2021-12-16 05:53:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2021-12-16 05:53:36,310 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2021-12-16 05:53:36,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:36,310 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2021-12-16 05:53:36,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2021-12-16 05:53:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:53:36,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:36,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:36,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:36,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:36,518 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:36,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:36,518 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2021-12-16 05:53:36,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:36,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779667438] [2021-12-16 05:53:36,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:36,519 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:36,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:36,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:36,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-16 05:53:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:36,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 05:53:36,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:36,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:36,650 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-16 05:53:36,650 INFO L388 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 20 treesize of output 27 [2021-12-16 05:53:36,669 INFO L388 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 13 treesize of output 9 [2021-12-16 05:53:36,743 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:53:36,744 INFO L388 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 37 treesize of output 38 [2021-12-16 05:53:36,780 INFO L388 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 34 treesize of output 16 [2021-12-16 05:53:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:53:36,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:53:36,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-16 05:53:36,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:36,909 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-16 05:53:36,912 INFO L388 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 44 treesize of output 32 [2021-12-16 05:53:36,915 INFO L388 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 15 treesize of output 11 [2021-12-16 05:53:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-16 05:53:41,080 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:41,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779667438] [2021-12-16 05:53:41,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779667438] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:53:41,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:53:41,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-12-16 05:53:41,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749561787] [2021-12-16 05:53:41,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:53:41,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-16 05:53:41,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 05:53:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=95, Unknown=3, NotChecked=20, Total=156 [2021-12-16 05:53:41,082 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:41,449 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2021-12-16 05:53:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:53:41,449 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 05:53:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:41,450 INFO L225 Difference]: With dead ends: 154 [2021-12-16 05:53:41,450 INFO L226 Difference]: Without dead ends: 154 [2021-12-16 05:53:41,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=46, Invalid=111, Unknown=3, NotChecked=22, Total=182 [2021-12-16 05:53:41,451 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:41,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 562 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 330 Unchecked, 0.3s Time] [2021-12-16 05:53:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-16 05:53:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2021-12-16 05:53:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-16 05:53:41,453 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2021-12-16 05:53:41,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:41,453 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-16 05:53:41,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:41,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-16 05:53:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:53:41,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:41,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:41,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:41,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:41,660 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2021-12-16 05:53:41,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:41,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178880843] [2021-12-16 05:53:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:41,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:41,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:41,661 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:41,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-16 05:53:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:41,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-16 05:53:41,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:41,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:41,797 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:53:41,797 INFO L388 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 14 treesize of output 14 [2021-12-16 05:53:41,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-16 05:53:41,823 INFO L388 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 [2021-12-16 05:53:41,843 INFO L388 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 13 treesize of output 9 [2021-12-16 05:53:41,962 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:53:41,962 INFO L388 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 46 treesize of output 45 [2021-12-16 05:53:41,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:53:42,038 INFO L388 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 31 treesize of output 13 [2021-12-16 05:53:42,042 INFO L388 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 19 treesize of output 7 [2021-12-16 05:53:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:42,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:53:42,402 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_305) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (.cse2 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-16 05:53:42,437 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_305) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_305) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3 (_ bv4 32)) (bvadd .cse2 .cse3 (_ bv8 32)))))) is different from false [2021-12-16 05:53:42,476 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_305) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_305 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_305) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-12-16 05:53:42,496 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:42,496 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-16 05:53:42,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:42,502 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-16 05:53:42,506 INFO L388 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 62 treesize of output 50 [2021-12-16 05:53:42,515 INFO L388 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 96 treesize of output 78 [2021-12-16 05:53:42,524 INFO L388 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 40 treesize of output 32 [2021-12-16 05:53:42,526 INFO L388 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 66 treesize of output 58 [2021-12-16 05:53:42,630 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:42,630 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2021-12-16 05:53:42,633 INFO L388 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 54 treesize of output 36 [2021-12-16 05:53:42,637 INFO L388 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 19 treesize of output 11 [2021-12-16 05:53:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-16 05:53:42,722 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:42,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178880843] [2021-12-16 05:53:42,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178880843] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:53:42,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:53:42,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-12-16 05:53:42,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217188097] [2021-12-16 05:53:42,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:53:42,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 05:53:42,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:42,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 05:53:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2021-12-16 05:53:42,724 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:44,471 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2021-12-16 05:53:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:53:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 05:53:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:44,473 INFO L225 Difference]: With dead ends: 160 [2021-12-16 05:53:44,473 INFO L226 Difference]: Without dead ends: 160 [2021-12-16 05:53:44,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=361, Unknown=3, NotChecked=126, Total=600 [2021-12-16 05:53:44,473 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:44,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 678 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 408 Invalid, 0 Unknown, 364 Unchecked, 1.3s Time] [2021-12-16 05:53:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-16 05:53:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2021-12-16 05:53:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2021-12-16 05:53:44,475 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2021-12-16 05:53:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:44,476 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2021-12-16 05:53:44,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2021-12-16 05:53:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 05:53:44,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:44,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:44,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:44,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:44,677 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2021-12-16 05:53:44,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:44,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337358548] [2021-12-16 05:53:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:44,678 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:44,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:44,679 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-16 05:53:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:44,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 05:53:44,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:44,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:44,832 INFO L388 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 [2021-12-16 05:53:44,857 INFO L388 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 20 treesize of output 12 [2021-12-16 05:53:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:44,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:44,864 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:44,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337358548] [2021-12-16 05:53:44,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337358548] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:44,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:44,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:44,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389771462] [2021-12-16 05:53:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:44,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:44,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:44,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:44,867 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:45,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:45,110 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2021-12-16 05:53:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:53:45,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-16 05:53:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:45,111 INFO L225 Difference]: With dead ends: 146 [2021-12-16 05:53:45,112 INFO L226 Difference]: Without dead ends: 146 [2021-12-16 05:53:45,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:53:45,112 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:45,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 160 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-16 05:53:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2021-12-16 05:53:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2021-12-16 05:53:45,114 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2021-12-16 05:53:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:45,114 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2021-12-16 05:53:45,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2021-12-16 05:53:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 05:53:45,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:45,115 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:45,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:45,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:45,324 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2021-12-16 05:53:45,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:45,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132633500] [2021-12-16 05:53:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:45,325 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:45,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:45,327 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:45,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-16 05:53:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:45,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 05:53:45,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:45,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:45,508 INFO L388 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 [2021-12-16 05:53:45,514 INFO L388 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 [2021-12-16 05:53:45,558 INFO L388 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 17 treesize of output 9 [2021-12-16 05:53:45,561 INFO L388 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 [2021-12-16 05:53:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:45,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:45,571 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:45,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132633500] [2021-12-16 05:53:45,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132633500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:45,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:45,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:45,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940855257] [2021-12-16 05:53:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:45,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:45,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:45,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:45,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:45,572 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:45,885 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2021-12-16 05:53:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:53:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-16 05:53:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:45,886 INFO L225 Difference]: With dead ends: 203 [2021-12-16 05:53:45,886 INFO L226 Difference]: Without dead ends: 203 [2021-12-16 05:53:45,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:53:45,887 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 164 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:45,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 187 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:53:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-16 05:53:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2021-12-16 05:53:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2021-12-16 05:53:45,890 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2021-12-16 05:53:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:45,890 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2021-12-16 05:53:45,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2021-12-16 05:53:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 05:53:45,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:45,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:45,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:46,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:46,095 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2021-12-16 05:53:46,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:46,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852219042] [2021-12-16 05:53:46,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:46,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:46,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:46,097 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:46,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-16 05:53:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:46,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-16 05:53:46,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:46,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:46,198 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:53:46,198 INFO L388 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 14 treesize of output 14 [2021-12-16 05:53:46,297 INFO L388 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 [2021-12-16 05:53:46,302 INFO L388 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 [2021-12-16 05:53:46,357 INFO L388 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 19 treesize of output 18 [2021-12-16 05:53:46,361 INFO L388 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 23 treesize of output 22 [2021-12-16 05:53:46,478 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-16 05:53:46,478 INFO L388 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 69 treesize of output 36 [2021-12-16 05:53:46,482 INFO L388 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 [2021-12-16 05:53:46,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:46,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:46,517 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:46,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852219042] [2021-12-16 05:53:46,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852219042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:46,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:46,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 05:53:46,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892605566] [2021-12-16 05:53:46,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:46,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 05:53:46,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:46,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 05:53:46,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:53:46,518 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:47,225 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2021-12-16 05:53:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:53:47,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-16 05:53:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:47,226 INFO L225 Difference]: With dead ends: 183 [2021-12-16 05:53:47,226 INFO L226 Difference]: Without dead ends: 183 [2021-12-16 05:53:47,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-12-16 05:53:47,227 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 196 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:47,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 493 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 358 Invalid, 0 Unknown, 73 Unchecked, 0.4s Time] [2021-12-16 05:53:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-16 05:53:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 128. [2021-12-16 05:53:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-12-16 05:53:47,229 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2021-12-16 05:53:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:47,229 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-12-16 05:53:47,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-12-16 05:53:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 05:53:47,230 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:47,230 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:47,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:47,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:47,437 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2021-12-16 05:53:47,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:47,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413142958] [2021-12-16 05:53:47,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 05:53:47,438 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:47,439 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:47,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-16 05:53:47,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 05:53:47,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 05:53:47,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 05:53:47,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:47,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:47,624 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:53:47,624 INFO L388 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 14 treesize of output 14 [2021-12-16 05:53:47,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-16 05:53:47,648 INFO L388 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 13 treesize of output 9 [2021-12-16 05:53:47,655 INFO L388 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 [2021-12-16 05:53:47,772 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:53:47,773 INFO L388 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 46 treesize of output 45 [2021-12-16 05:53:47,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:53:47,900 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:53:47,901 INFO L388 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 68 treesize of output 65 [2021-12-16 05:53:47,906 INFO L388 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 68 treesize of output 64 [2021-12-16 05:53:47,992 INFO L388 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 31 treesize of output 13 [2021-12-16 05:53:47,995 INFO L388 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 19 treesize of output 7 [2021-12-16 05:53:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:48,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:53:51,306 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:51,306 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 222 [2021-12-16 05:53:51,320 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:51,320 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 172 [2021-12-16 05:53:51,323 INFO L388 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 584 treesize of output 500 [2021-12-16 05:53:51,329 INFO L388 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 2304 treesize of output 2130 [2021-12-16 05:53:51,339 INFO L388 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 2130 treesize of output 2018 [2021-12-16 05:53:51,353 INFO L388 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 2018 treesize of output 1810 [2021-12-16 05:53:51,377 INFO L388 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 1677 treesize of output 1549 [2021-12-16 05:53:51,409 INFO L388 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 1549 treesize of output 1421 [2021-12-16 05:53:51,426 INFO L388 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 1421 treesize of output 1357 [2021-12-16 05:53:51,442 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:51,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413142958] [2021-12-16 05:53:51,443 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-16 05:53:51,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [803752777] [2021-12-16 05:53:51,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 05:53:51,443 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-16 05:53:51,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-16 05:53:51,445 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) [2021-12-16 05:53:51,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-12-16 05:53:51,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 05:53:51,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 05:53:51,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-16 05:53:51,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:51,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:51,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:51,696 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:53:51,696 INFO L388 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 14 treesize of output 14 [2021-12-16 05:53:51,709 INFO L388 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 [2021-12-16 05:53:51,715 INFO L388 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 13 treesize of output 9 [2021-12-16 05:53:51,776 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:53:51,777 INFO L388 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 46 treesize of output 45 [2021-12-16 05:53:51,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:53:51,884 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:53:51,885 INFO L388 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 46 treesize of output 45 [2021-12-16 05:53:51,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:53:51,950 INFO L388 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 31 treesize of output 13 [2021-12-16 05:53:51,953 INFO L388 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 19 treesize of output 7 [2021-12-16 05:53:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:51,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:53:52,121 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (.cse1 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2021-12-16 05:53:52,158 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (.cse3 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse2 .cse3 (_ bv4 32)) (bvadd .cse2 .cse3 (_ bv8 32)))))) is different from false [2021-12-16 05:53:52,207 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (.cse1 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2021-12-16 05:53:52,265 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_505) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (.cse1 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_506)) (.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_505) .cse3 v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2021-12-16 05:53:52,516 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32))) (.cse1 (let ((.cse3 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_505) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_508)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_506))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_505) .cse5 v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))))))))) is different from false [2021-12-16 05:53:52,568 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_505) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_508)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_506))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_505) .cse4 v_ArrVal_508) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))) is different from false [2021-12-16 05:53:52,585 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:52,585 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2021-12-16 05:53:52,594 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:52,594 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2021-12-16 05:53:52,598 INFO L388 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 400 treesize of output 334 [2021-12-16 05:53:52,602 INFO L388 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 688 treesize of output 634 [2021-12-16 05:53:52,616 INFO L388 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 630 treesize of output 582 [2021-12-16 05:53:52,620 INFO L388 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 582 treesize of output 478 [2021-12-16 05:53:52,624 INFO L388 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 478 treesize of output 462 [2021-12-16 05:53:52,627 INFO L388 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 462 treesize of output 414 [2021-12-16 05:53:53,783 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:53,784 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2021-12-16 05:53:53,791 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:53,792 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2021-12-16 05:53:53,795 INFO L388 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 102 treesize of output 84 [2021-12-16 05:53:53,805 INFO L388 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 286 treesize of output 244 [2021-12-16 05:53:53,816 INFO L388 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 202 treesize of output 186 [2021-12-16 05:53:53,827 INFO L388 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 186 treesize of output 162 [2021-12-16 05:53:53,830 INFO L388 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 200 treesize of output 160 [2021-12-16 05:53:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-16 05:53:54,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [803752777] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:53:54,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 05:53:54,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2021-12-16 05:53:54,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512010066] [2021-12-16 05:53:54,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 05:53:54,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-16 05:53:54,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-16 05:53:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=356, Unknown=21, NotChecked=270, Total=756 [2021-12-16 05:53:54,305 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:57,120 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2021-12-16 05:53:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:53:57,121 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-16 05:53:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:57,122 INFO L225 Difference]: With dead ends: 167 [2021-12-16 05:53:57,122 INFO L226 Difference]: Without dead ends: 167 [2021-12-16 05:53:57,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=229, Invalid=830, Unknown=21, NotChecked=402, Total=1482 [2021-12-16 05:53:57,123 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 86 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 659 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:57,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 735 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 599 Invalid, 0 Unknown, 659 Unchecked, 1.6s Time] [2021-12-16 05:53:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-16 05:53:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 133. [2021-12-16 05:53:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-16 05:53:57,127 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 23 [2021-12-16 05:53:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:57,127 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-16 05:53:57,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-16 05:53:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-16 05:53:57,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:57,128 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:57,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:57,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:57,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:57,531 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:57,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:57,532 INFO L85 PathProgramCache]: Analyzing trace with hash -543267076, now seen corresponding path program 1 times [2021-12-16 05:53:57,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:57,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464539452] [2021-12-16 05:53:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:57,532 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:57,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:57,533 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:57,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-16 05:53:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:57,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 05:53:57,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:57,669 INFO L388 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 [2021-12-16 05:53:57,701 INFO L388 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 [2021-12-16 05:53:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:57,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:57,707 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:57,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464539452] [2021-12-16 05:53:57,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464539452] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:57,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:57,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:57,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883670678] [2021-12-16 05:53:57,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:57,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:57,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:57,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:57,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:57,708 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:57,883 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2021-12-16 05:53:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 05:53:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-16 05:53:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:57,886 INFO L225 Difference]: With dead ends: 167 [2021-12-16 05:53:57,886 INFO L226 Difference]: Without dead ends: 167 [2021-12-16 05:53:57,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:53:57,887 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 155 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:57,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 169 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:53:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-16 05:53:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2021-12-16 05:53:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2021-12-16 05:53:57,889 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 25 [2021-12-16 05:53:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:57,890 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2021-12-16 05:53:57,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2021-12-16 05:53:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 05:53:57,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:57,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:57,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:58,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:58,095 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash 338589996, now seen corresponding path program 1 times [2021-12-16 05:53:58,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:58,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075934768] [2021-12-16 05:53:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:58,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:58,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:58,097 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:58,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-16 05:53:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:58,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 05:53:58,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:58,289 INFO L388 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 [2021-12-16 05:53:58,364 INFO L388 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 23 treesize of output 11 [2021-12-16 05:53:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:58,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:58,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:58,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075934768] [2021-12-16 05:53:58,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075934768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:58,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:58,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:58,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232421400] [2021-12-16 05:53:58,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:58,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:53:58,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:53:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:53:58,388 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:58,689 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2021-12-16 05:53:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:53:58,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-16 05:53:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:58,690 INFO L225 Difference]: With dead ends: 168 [2021-12-16 05:53:58,690 INFO L226 Difference]: Without dead ends: 168 [2021-12-16 05:53:58,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:53:58,691 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 154 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:58,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 144 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:53:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-16 05:53:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2021-12-16 05:53:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 145 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2021-12-16 05:53:58,693 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 26 [2021-12-16 05:53:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:58,694 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2021-12-16 05:53:58,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2021-12-16 05:53:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:53:58,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:58,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:58,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:58,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:58,912 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:58,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1906355454, now seen corresponding path program 1 times [2021-12-16 05:53:58,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:58,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96111042] [2021-12-16 05:53:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:58,912 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:58,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:58,913 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:58,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-16 05:53:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:58,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 05:53:58,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:59,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:59,083 INFO L388 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 [2021-12-16 05:53:59,124 INFO L388 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 20 treesize of output 12 [2021-12-16 05:53:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:53:59,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:53:59,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:53:59,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96111042] [2021-12-16 05:53:59,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96111042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:53:59,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:53:59,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:53:59,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588480532] [2021-12-16 05:53:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:53:59,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:53:59,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:53:59,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:53:59,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:53:59,138 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:53:59,429 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2021-12-16 05:53:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:53:59,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-16 05:53:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:53:59,431 INFO L225 Difference]: With dead ends: 167 [2021-12-16 05:53:59,431 INFO L226 Difference]: Without dead ends: 167 [2021-12-16 05:53:59,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:53:59,431 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:53:59,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 164 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:53:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-16 05:53:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2021-12-16 05:53:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2021-12-16 05:53:59,433 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 27 [2021-12-16 05:53:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:53:59,434 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2021-12-16 05:53:59,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:53:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2021-12-16 05:53:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:53:59,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:53:59,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:53:59,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-16 05:53:59,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:53:59,635 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:53:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:53:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823547, now seen corresponding path program 1 times [2021-12-16 05:53:59,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:53:59,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801182000] [2021-12-16 05:53:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:53:59,635 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:53:59,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:53:59,637 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:53:59,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-16 05:53:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:53:59,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 05:53:59,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:53:59,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:53:59,981 INFO L388 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 [2021-12-16 05:54:00,032 INFO L388 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 [2021-12-16 05:54:00,049 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-16 05:54:00,050 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2021-12-16 05:54:00,158 INFO L388 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 [2021-12-16 05:54:00,191 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:00,191 INFO L388 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 39 treesize of output 30 [2021-12-16 05:54:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:00,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:00,230 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:54:00,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801182000] [2021-12-16 05:54:00,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801182000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:00,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:00,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 05:54:00,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30311474] [2021-12-16 05:54:00,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:00,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:54:00,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:54:00,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:54:00,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:54:00,232 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:01,119 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2021-12-16 05:54:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 05:54:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-16 05:54:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:01,128 INFO L225 Difference]: With dead ends: 175 [2021-12-16 05:54:01,128 INFO L226 Difference]: Without dead ends: 175 [2021-12-16 05:54:01,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-12-16 05:54:01,129 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 172 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:01,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 380 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 469 Invalid, 0 Unknown, 77 Unchecked, 0.6s Time] [2021-12-16 05:54:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-16 05:54:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 154. [2021-12-16 05:54:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.4140625) internal successors, (181), 153 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2021-12-16 05:54:01,132 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 27 [2021-12-16 05:54:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:01,132 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2021-12-16 05:54:01,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2021-12-16 05:54:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:54:01,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:01,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:01,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-16 05:54:01,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:54:01,333 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:54:01,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:01,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823546, now seen corresponding path program 1 times [2021-12-16 05:54:01,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:54:01,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443798534] [2021-12-16 05:54:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:01,334 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:54:01,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:54:01,335 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:54:01,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-16 05:54:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:01,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-16 05:54:01,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:01,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:01,493 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:01,494 INFO L388 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 14 treesize of output 14 [2021-12-16 05:54:01,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:01,663 INFO L388 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 [2021-12-16 05:54:01,674 INFO L388 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 [2021-12-16 05:54:01,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 05:54:01,722 INFO L388 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 23 treesize of output 22 [2021-12-16 05:54:01,845 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-16 05:54:01,846 INFO L388 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 71 treesize of output 38 [2021-12-16 05:54:01,852 INFO L388 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 [2021-12-16 05:54:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:01,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:01,894 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:54:01,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443798534] [2021-12-16 05:54:01,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443798534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:01,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:01,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 05:54:01,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57698166] [2021-12-16 05:54:01,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:01,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:54:01,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:54:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:54:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:54:01,895 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:03,111 INFO L93 Difference]: Finished difference Result 216 states and 242 transitions. [2021-12-16 05:54:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 05:54:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-16 05:54:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:03,114 INFO L225 Difference]: With dead ends: 216 [2021-12-16 05:54:03,114 INFO L226 Difference]: Without dead ends: 216 [2021-12-16 05:54:03,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-12-16 05:54:03,119 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 276 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:03,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 373 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 615 Invalid, 0 Unknown, 100 Unchecked, 0.8s Time] [2021-12-16 05:54:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-16 05:54:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 164. [2021-12-16 05:54:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 163 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-12-16 05:54:03,122 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 27 [2021-12-16 05:54:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:03,122 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-12-16 05:54:03,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-12-16 05:54:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:54:03,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:03,123 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:03,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-16 05:54:03,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:54:03,331 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:54:03,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522897, now seen corresponding path program 1 times [2021-12-16 05:54:03,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:54:03,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505039914] [2021-12-16 05:54:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:03,332 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:54:03,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:54:03,333 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:54:03,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-16 05:54:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:03,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 05:54:03,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:03,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-16 05:54:03,564 INFO L388 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 [2021-12-16 05:54:03,568 INFO L388 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 [2021-12-16 05:54:03,645 INFO L388 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 [2021-12-16 05:54:03,764 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:03,764 INFO L388 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 27 treesize of output 18 [2021-12-16 05:54:03,796 INFO L388 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 14 treesize of output 16 [2021-12-16 05:54:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:03,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:03,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:54:03,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505039914] [2021-12-16 05:54:03,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505039914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:03,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:03,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 05:54:03,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260518394] [2021-12-16 05:54:03,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:03,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:54:03,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:54:03,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:54:03,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:54:03,806 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:04,711 INFO L93 Difference]: Finished difference Result 188 states and 210 transitions. [2021-12-16 05:54:04,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:54:04,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-16 05:54:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:04,712 INFO L225 Difference]: With dead ends: 188 [2021-12-16 05:54:04,712 INFO L226 Difference]: Without dead ends: 188 [2021-12-16 05:54:04,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2021-12-16 05:54:04,713 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 348 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:04,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 296 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 05:54:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-16 05:54:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 165. [2021-12-16 05:54:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.4244604316546763) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2021-12-16 05:54:04,716 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 28 [2021-12-16 05:54:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:04,716 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2021-12-16 05:54:04,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2021-12-16 05:54:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:54:04,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:04,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:04,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-16 05:54:04,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:54:04,924 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:54:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:04,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522896, now seen corresponding path program 1 times [2021-12-16 05:54:04,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:54:04,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675708997] [2021-12-16 05:54:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:54:04,925 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:54:04,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:54:04,926 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:54:04,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-16 05:54:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:54:05,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 05:54:05,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:05,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:54:05,109 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:54:05,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675708997] [2021-12-16 05:54:05,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675708997] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:54:05,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:54:05,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:54:05,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219968913] [2021-12-16 05:54:05,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:54:05,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:54:05,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 05:54:05,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:54:05,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:05,110 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:54:05,202 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2021-12-16 05:54:05,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:54:05,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-16 05:54:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:54:05,204 INFO L225 Difference]: With dead ends: 160 [2021-12-16 05:54:05,205 INFO L226 Difference]: Without dead ends: 160 [2021-12-16 05:54:05,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:54:05,205 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:54:05,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 50 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:54:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-16 05:54:05,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-16 05:54:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2021-12-16 05:54:05,208 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 28 [2021-12-16 05:54:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:54:05,209 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2021-12-16 05:54:05,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:54:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2021-12-16 05:54:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:54:05,209 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:54:05,209 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:54:05,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-16 05:54:05,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 05:54:05,416 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-16 05:54:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:54:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1865364083, now seen corresponding path program 3 times [2021-12-16 05:54:05,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 05:54:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16138134] [2021-12-16 05:54:05,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 05:54:05,417 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 05:54:05,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 05:54:05,418 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 05:54:05,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-16 05:54:05,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-16 05:54:05,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 05:54:05,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-16 05:54:05,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:05,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:05,750 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:05,751 INFO L388 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 14 treesize of output 14 [2021-12-16 05:54:05,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-16 05:54:05,772 INFO L388 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 13 treesize of output 9 [2021-12-16 05:54:05,778 INFO L388 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 [2021-12-16 05:54:05,890 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:54:05,890 INFO L388 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 46 treesize of output 45 [2021-12-16 05:54:05,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:54:06,035 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:54:06,035 INFO L388 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 46 treesize of output 45 [2021-12-16 05:54:06,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:54:06,169 INFO L388 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 68 treesize of output 64 [2021-12-16 05:54:06,182 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:54:06,182 INFO L388 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 56 treesize of output 55 [2021-12-16 05:54:06,252 INFO L388 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 31 treesize of output 13 [2021-12-16 05:54:06,255 INFO L388 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 19 treesize of output 7 [2021-12-16 05:54:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:06,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:06,873 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)) (.cse6 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (let ((.cse7 (bvadd .cse5 .cse6 (_ bv4 32)))) (or (and (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_816 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_817) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_816) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_817 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_817) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (.cse3 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse2 .cse3 (_ bv4 32)) (bvadd .cse2 .cse3 (_ bv8 32)))))) (not (bvule (bvadd .cse5 .cse6) .cse7)) (not (bvule .cse7 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))))))) is different from false [2021-12-16 05:54:14,813 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:14,813 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 536 treesize of output 486 [2021-12-16 05:54:14,837 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:14,838 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 486 treesize of output 316 [2021-12-16 05:54:14,858 INFO L388 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 5316 treesize of output 4632 [2021-12-16 05:54:14,900 INFO L388 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 99572 treesize of output 96434 [2021-12-16 05:54:15,132 INFO L388 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 96434 treesize of output 92402 [2021-12-16 05:54:15,363 INFO L388 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 92402 treesize of output 90314 [2021-12-16 05:54:15,598 INFO L388 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 90314 treesize of output 80634 [2021-12-16 05:54:15,827 INFO L388 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 80634 treesize of output 74058 [2021-12-16 05:54:16,273 INFO L388 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 72505 treesize of output 66521 [2021-12-16 05:54:16,494 INFO L388 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 66521 treesize of output 60537 [2021-12-16 05:54:16,737 INFO L388 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 60537 treesize of output 58697 [2021-12-16 05:54:16,925 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 05:54:16,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16138134] [2021-12-16 05:54:16,925 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-16 05:54:16,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [720417172] [2021-12-16 05:54:16,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 05:54:16,926 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-16 05:54:16,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-16 05:54:16,927 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-16 05:54:16,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-12-16 05:54:17,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-16 05:54:17,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 05:54:17,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-16 05:54:17,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:54:17,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:17,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 05:54:17,416 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:54:17,416 INFO L388 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 14 treesize of output 14 [2021-12-16 05:54:17,442 INFO L388 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 13 treesize of output 9 [2021-12-16 05:54:17,455 INFO L388 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 [2021-12-16 05:54:17,532 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:54:17,532 INFO L388 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 46 treesize of output 45 [2021-12-16 05:54:17,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:54:17,652 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:54:17,652 INFO L388 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 46 treesize of output 45 [2021-12-16 05:54:17,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:54:17,799 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:54:17,799 INFO L388 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 46 treesize of output 45 [2021-12-16 05:54:17,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 05:54:17,866 INFO L388 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 31 treesize of output 13 [2021-12-16 05:54:17,871 INFO L388 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 19 treesize of output 7 [2021-12-16 05:54:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:54:17,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:54:18,098 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (bvule (bvadd (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))) (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32))))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-16 05:54:18,135 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3 (_ bv4 32)) (bvadd .cse2 .cse3 (_ bv8 32)))))) is different from false [2021-12-16 05:54:18,209 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2021-12-16 05:54:18,267 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_892)) (.cse1 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_891) .cse0 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_891) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (.cse4 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse3 .cse4 (_ bv8 32)) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-16 05:54:18,396 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_892))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_891) .cse1 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_891) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) v_ArrVal_894)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (.cse5 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv8 32)) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-16 05:54:18,473 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_891) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_894)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (.cse1 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_892))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_891) .cse5 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))))))))) is different from false [2021-12-16 05:54:18,608 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_890))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_889) .cse2 v_ArrVal_891) (select (select (store .cse3 .cse2 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_894))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (.cse1 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_890)) (.cse7 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_892))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_889) .cse5 v_ArrVal_891) .cse6 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))))))))) is different from false [2021-12-16 05:54:20,738 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_890))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_889) .cse3 v_ArrVal_891) (select (select (store .cse4 .cse3 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_894)))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (.cse1 (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_890))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_892))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_889) .cse7 v_ArrVal_891) .cse8 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) (bvmul |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))))))))))) is different from false [2021-12-16 05:54:20,909 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_890))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_889) .cse2 v_ArrVal_891) (select (select (store .cse3 .cse2 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_894)))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd .cse0 (_ bv16 32))))) (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_894 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_create_data_~data~0#1.offset| (_ bv4 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_890))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_892))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_889) .cse6 v_ArrVal_891) .cse7 v_ArrVal_894) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) (_ bv16 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_893) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))))))))))) is different from false [2021-12-16 05:54:20,956 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:20,957 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2021-12-16 05:54:20,984 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:54:20,985 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2021-12-16 05:54:21,001 INFO L388 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 44510 treesize of output 36452 [2021-12-16 05:54:21,146 INFO L388 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 149894 treesize of output 143360 [2021-12-16 05:54:21,721 INFO L388 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 143356 treesize of output 133116 [2021-12-16 05:54:22,011 INFO L388 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 133116 treesize of output 117532 [2021-12-16 05:54:22,303 INFO L388 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 117532 treesize of output 107292 [2021-12-16 05:54:22,589 INFO L388 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 107292 treesize of output 94020 [2021-12-16 05:54:22,871 INFO L388 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 94020 treesize of output 92740 [2021-12-16 05:54:23,180 INFO L388 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 92740 treesize of output 88132